𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the conjecture of hajós

✍ Scribed by Paul Erdős; Siemion Fajtlowicz


Book ID
110564317
Publisher
Springer-Verlag
Year
1981
Tongue
English
Weight
137 KB
Volume
1
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Triangulations and the Hajós conjecture
✍ Vojtěch Rödl; Jan Zich 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 325 KB

## Abstract In his recent work Thomassen [J Combin Theory Ser B 93 (2005), 95–105] discussed various refinements of Hajós conjecture. Shortly after Mohar [Electr J Combin 12 (2005), N15] provided an answer to Thomassen's Conjecture 6.5, and proposed a possible extension. The aim of this article is

Hajós' conjecture and small cycle double
✍ Karen Seyffarth 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 865 KB

## Seyffarth, K., Hajos' conjecture and small cycle double covers of planar graphs, Discrete Mathematics 101 (1992) 291-306. We prove that every simple even planar graph on n vertices has a partition of its edge set into at most [(n -1)/2] cycles. A previous proof of this result was given by Tao,

On the Loebl–Komlós–Sós conjecture
✍ Cristina Bazgan; Hao Li; Mariusz Woźniak 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

The Loebl±Komlo  s±So  s conjecture says that any graph G on n vertices with at least half of vertices of degree at least k contains each tree of size k. We prove that the conjecture is true for paths as well as for large values of k(k ! n À 3).

The Hajós Factorization of Elementary 3-
✍ Khalid Amin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 68 KB

If G is a finite abelian group and n ) 1 is an integer, we say that G has the Hajos n-property, or is n-good if from each decomposition G s S S . . . S of G ´1 2 n into a direct product of subsets, it follows that at least one of the S is periodic, i Ä 4 meaning that there exists x g G y e such that