A stability theorem on fractional covering of triangles by edges
From MaRDI portal
Publication:412272
DOI10.1016/j.ejc.2011.09.024zbMath1239.05030OpenAlexW2038193038MaRDI QIDQ412272
Penny E. Haxell, Steéphan Thomassé, Alexandr V. Kostochka
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.024
Related Items (11)
A semidefinite approach to the $K_i$-cover problem ⋮ Fractional \(K_{4}\)-covers ⋮ Packing and covering triangles in \(K_{4}\)-free planar graphs ⋮ Small edge sets meeting all triangles of a graph ⋮ Triangle packings and transversals of some \(K_{4}\)-free graphs ⋮ Tuza's conjecture for random graphs ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ Triangle packing and covering in dense random graphs ⋮ Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number ⋮ Improved bounds on a generalization of Tuza's conjecture ⋮ Tuza's conjecture for graphs with maximum average degree less than 7
Cites Work
- Maximum degree and fractional matchings in uniform hypergraphs
- Packing and covering triangles in graphs
- Packing and covering triangles in tripartite graphs
- On a conjecture of Tuza about packing and covering of triangles
- A conjecture on triangles of graphs
- The Ramsey number R(3, t) has order of magnitude t2/log t
This page was built for publication: A stability theorem on fractional covering of triangles by edges
