𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ryser's Conjecture for Tripartite 3-Graphs

✍ Scribed by Ron Aharoni

Book ID
106167915
Publisher
Springer-Verlag
Year
2001
Tongue
English
Weight
111 KB
Volume
21
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Ádám's conjecture for circulant graph
On Ádám's conjecture for circulant graphs
✍ Mikhail Muzychuk 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 643 KB

Adfim's (1967) conjecture formulates necessary and sufficient conditions for cyclic (circulant) graphs to be isomorphic. It is known that the conjecture fails if n is divisible by either 8 or by an odd square. On the other hand, it was shown in [?] that the conjecture is true for circulant graphs w

Hadwiger's conjecture for quasi-line gra
Hadwiger's conjecture for quasi-line graphs
✍ Maria Chudnovsky; Alexandra Ovetsky Fradkin 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

## Abstract A graph __G__ is a quasi‐line graph if for every vertex __v__ ∈ __V__(__G__), the set of neighbors of __v__ in __G__ can be expressed as the union of two cliques. The class of quasi‐line graphs is a proper superset of the class of line graphs. Hadwiger's conjecture states that if a grap

On Pósa's Conjecture for Random Graphs
On Pósa's Conjecture for Random Graphs
✍ Kühn, Daniela; Osthus, Deryk 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 321 KB