Zs. Tuza conjectured that if a simple graph G does not contain more than k pairwise edge disjoint triangles, then there exists a set of at most 2k edges which meets all triangles in G. We prove this conjecture for K,, 3 -free graphs (graphs that do not contain a homeomorph of K,. 3). Two fractional
On a conjecture of Croft, Falconer and Guy on finite packings
โ Scribed by C. Zong
- Book ID
- 105110352
- Publisher
- Springer
- Year
- 1995
- Tongue
- English
- Weight
- 182 KB
- Volume
- 64
- Category
- Article
- ISSN
- 0003-889X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this note we improve significantly the result appeared in [4] by showing that any sequence of trees { T2, 'I;, . , T,} can be packed into the complete bipartite graph K,\_,,n,z (n even) for f = 0.3n. Furthermore we support Fishburn's Conjecture [2] by showing that any sequence {T,, T4,
For a maximal subgroup M of a finite group G, a 0-subgroup for M is any subgroup C of G such that C ~( M and corec(M A C) is maximal among proper normal subgroups of G contained in C. The aim of this note is to give an answer to Deskins's conjecture on the supersolvability of a finite group by means
We use the classification of finite simple groups to demonstrate that Conjecture ลฝ ลฝ . . 4.1 of G. R. Robinson 1996, Proc. London Math. Soc. 3 72, 312แ330 and Dade's projective conjecture hold for finite groups of p-local rank one.