✦ LIBER ✦

Hexagon-free subgraphs of hypercubes

✍ Scribed by Marston Conder

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 151 KB
Volume: 17
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190170405

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

📜 SIMILAR VOLUMES

Bulky Subgraphs of the Hypercube

✍ Andrei Kotlov 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 91 KB

On k-detour subgraphs of hypercubes

✍ Nana Arizumi; Peter Hamburger; Alexandr Kostochka 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

## Abstract A spanning subgraph __G__ of a graph __H__ is a __k__‐__detour subgraph__ of __H__ if for each pair of vertices $x,y \in V(H)$, the distance, ${\rm dist}\_G(x,y)$, between __x__ and __y__ in __G__ exceeds that in __H__ by at most __k__. Such subgraphs sometimes also are called __additiv

Hypercube subgraphs with local detours

✍ Hamburger, Peter; Kostochka, Alexandr V.; Sidorenko, Alexander 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB

A minimal detour subgraph of the n-dimensional cube is a spanning subgraph G of Q n having the property that, for vertices x, y of Q n , distances are related by d G (x, y) ≤ d Qn (x, y)+2. For a spanning subgraph G of Q n to be a local detour subgraph, we require only that the above inequality be s

Hypercube subgraphs with minimal detours

✍ Erd�s, P�l; Hamburger, Peter; Pippert, Raymond E.; Weakley, William D. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 546 KB

Define a minimal detour subgraph of the n-dimensional cube to be a spanning subgraph G of Qn having the property that for vertices 2, y of Qn, distances are related by dG(z, y) 5 dQ,(z,y) + 2. Let f(n) be the minimum number of edges of such a subgraph of Qn. After preliminary work on distances in s

Subgraphs of a hypercube containing no s

Subgraphs of a hypercube containing no small even cycles

✍ Fan R. K. Chung 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 490 KB

## Abstract We investigate several Ramsey‐Turán type problems for subgraphs of a hypercube. We obtain upper and lower bounds for the maximum number of edges in a subgraph of a hypercube containing no four‐cycles or more generally, no 2__k__‐cycles __C__~2k~. These extermal results imply, for exampl

Hexagon

✍ John Brosens 📂 Fiction 📅 2021 🌐 nl-NL ⚖ 66 KB 👁 1 views