𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Balogh, József; Hu, Ping; Lidický, Bernard; Liu, Hong

Book ID
122181265
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
496 KB
Volume
35
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Forbidden subgraphs and bounds on the si
Forbidden subgraphs and bounds on the size of a maximum matching
✍ Michael D. Plummer; Akira Saito 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let __K__~1,__n__~ denote the star on __n__ + 1 vertices; that is, __K__~1,__n__~ is the complete bipartite graph having one vertex in the first vertex class of its bipartition and __n__ in the second. The special graph __K__~1,3~, called the __claw__, has received much attention in the

Upper Bounds on the Size of Obstructions
Upper Bounds on the Size of Obstructions and Intertwines
✍ Jens Lagergren 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 417 KB

We give an exponential upper bound in p 4 on the size of any obstruction for path-width at most p. We give a doubly exponential upper bound in k 5 on the size of any obstruction for tree-width at most k. We also give an upper bound on the size of any intertwine of two given trees T and T $. The boun