Fractional Triangle Decompositions in Graphs with Large Minimum Degree
From MaRDI portal
Publication:3462543
DOI10.1137/15M1014310zbMath1329.05244arXiv1503.08191MaRDI QIDQ3462543
Publication date: 15 January 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.08191
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Related Items (15)
Clique decompositions of multipartite graphs and completion of Latin squares ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Fractional clique decompositions of dense graphs and hypergraphs ⋮ On determining when small embeddings of partial Steiner triple systems exist ⋮ Graph and hypergraph packing ⋮ Completion and deficiency problems ⋮ Minimalist designs ⋮ Fractional Clique Decompositions of Dense Partite Graphs ⋮ Progress towards Nash-Williams' conjecture on triangle decompositions ⋮ On the Weisfeiler-Leman dimension of fractional packing ⋮ Triangle decompositions of planar graphs ⋮ Resolution of the Oberwolfach problem ⋮ On the Minimum Degree Required for a Triangle Decomposition ⋮ Sharp bounds for decomposing graphs into edges and triangles ⋮ On the decomposition threshold of a given graph
Cites Work
- Unnamed Item
- Rational decomposition of dense hypergraphs and some related eigenvalue estimates
- Corrigendum to ``Rational decomposition of dense hypergraphs and some related eigenvalue estimates
- Fractional clique decompositions of dense graphs and hypergraphs
- Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
- The decomposition threshold for bipartite graphs with minimum degree one
- Edge-decompositions of graphs with high minimum degree
This page was built for publication: Fractional Triangle Decompositions in Graphs with Large Minimum Degree
