A stability theorem on fractional covering of triangles by edges
From MaRDI portal
(Redirected from Publication:412272)
Recommendations
- On the multiple covering densities of triangles
- scientific article; zbMATH DE number 4195918
- scientific article; zbMATH DE number 609944
- Fractional v. integral covers in hypergraphs of bounded edge size
- scientific article; zbMATH DE number 4043826
- A stability result for the cube edge isoperimetric inequality
- On a covering problem for equilateral triangles
- Triangulations and the stability theorem for foliations
- The stability of Delaunay triangulations
- A stability theorem on cube tessellations
Cites work
- A conjecture on triangles of graphs
- Maximum degree and fractional matchings in uniform hypergraphs
- On a conjecture of Tuza about packing and covering of triangles
- Packing and covering triangles in graphs
- Packing and covering triangles in tripartite graphs
- The Ramsey number R(3, t) has order of magnitude t2/log t
Cited in
(12)- Fractional \(K_{4}\)-covers
- Improved bounds on a generalization of Tuza's conjecture
- Generalized Tuza's conjecture for random hypergraphs
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- Triangle packing and covering in dense random graphs
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
- A semidefinite approach to the $K_i$-cover problem
- Tuza's conjecture for random graphs
- Small edge sets meeting all triangles of a graph
- Triangle packings and transversals of some \(K_{4}\)-free graphs
- Tuza's conjecture for graphs with maximum average degree less than 7
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
This page was built for publication: A stability theorem on fractional covering of triangles by edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412272)
