𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximate version of Sumnerʼs universal tournament conjecture

✍ Scribed by Daniela Kühn; Richard Mycroft; Deryk Osthus

Book ID
113698876
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
458 KB
Volume
101
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximate version of Hadwiger's con
An approximate version of Hadwiger's conjecture for claw-free graphs
✍ Maria Chudnovsky; Alexandra Ovetsky Fradkin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB

## Abstract Hadwiger's conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class of claw‐free graphs (graphs that do not have a vertex with three pairwise nonadjacent neighbors). Our main resul

An Equivalent Version of the 3-Flow Conj
An Equivalent Version of the 3-Flow Conjecture
✍ Martin Kochol 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 88 KB

The 3-flow conjecture of Tutte is that every bridgeless graph without a 3-edge cut has a nowhere-zero 3-flow. We show that it suffices to prove this conjecture for 5-edge-connected graphs.

An Asymptotic Version of the Multigraph
An Asymptotic Version of the Multigraph 1-Factorization Conjecture
✍ E. R. Vaughan 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

## Abstract We give a self‐contained proof that for all positive integers __r__ and all , there is an integer such that for all any regular multigraph of order 2__n__ with multiplicity at most __r__ and degree at least is 1‐factorizable. This generalizes results of Perković and Reed (Discrete Ma