On the decomposition threshold of a given graph
From MaRDI portal
Publication:2338634
DOI10.1016/j.jctb.2019.02.010zbMath1428.05246arXiv1603.04724OpenAlexW2963353004WikidataQ128137867 ScholiaQ128137867MaRDI QIDQ2338634
Stefan Glock, Deryk Osthus, Richard Montgomery, Allan Lo, Daniela Kühn
Publication date: 21 November 2019
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.04724
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Related Items (16)
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Dirac-type theorems in random hypergraphs ⋮ Graph theory -- a survey on the occasion of the Abel Prize for László Lovász ⋮ Fractional cycle decompositions in hypergraphs ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Graph and hypergraph packing ⋮ Exact values for some unbalanced Zarankiewicz numbers ⋮ Minimalist designs ⋮ Progress towards Nash-Williams' conjecture on triangle decompositions ⋮ Coloured and Directed Designs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Optimal packings of bounded degree trees ⋮ Resolution of the Oberwolfach problem ⋮ Packing degenerate graphs ⋮ An Evans-Style Result for Block Designs ⋮ Local balance in graph decompositions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Corrigendum to ``Rational decomposition of dense hypergraphs and some related eigenvalue estimates
- Integer and fractional packings in dense graphs
- Tiling Turán theorems
- Fractional triangle decompositions of dense 3-partite graphs
- \(H\)-packing of \(k\)-chromatic graphs
- Clique decompositions of multipartite graphs and completion of Latin squares
- Fractional clique decompositions of dense graphs and hypergraphs
- Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
- Edge-Disjoint Cliques in Graphs with High Minimum Degree
- Fractional Triangle Decompositions in Graphs with Large Minimum Degree
- Proof of a tiling conjecture of Komlós
- On the exact decomposition threshold for even cycles
- The decomposition threshold for bipartite graphs with minimum degree one
- Fractional clique decompositions of dense graphs
- Edge-disjoint Hamilton cycles in random graphs
- Decomposing Graphs of High Minimum Degree into 4‐Cycles
- Fractional Clique Decompositions of Dense Partite Graphs
- Edge-decompositions of graphs with high minimum degree
This page was built for publication: On the decomposition threshold of a given graph
