✦ LIBER ✦

On even-cycle-free subgraphs of the hypercube

✍ Scribed by Zoltán Füredi; Lale Özkahya

Book ID: 108167340
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 121 KB
Volume: 118
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2011.02.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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-free subgraphs of hypercubes

✍ Marston Conder 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

Upper bounds on the size of 4- and 6-cyc

Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube

✍ Balogh, József; Hu, Ping; Lidický, Bernard; Liu, Hong 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 496 KB

On 2-Detour Subgraphs of the Hypercube

✍ József Balogh; Alexandr Kostochka 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 121 KB

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