Pages that link to "Item:Q5899605"
From MaRDI portal
The following pages link to Edge-decompositions of graphs with high minimum degree (Q5899605):
Displayed 26 items.
- Decompositions of complete graphs into bipartite 2-regular subgraphs (Q281575) (← links)
- Matching divisible designs with block size four (Q898140) (← links)
- A proof of the Barát-Thomassen conjecture (Q1989951) (← links)
- Clumsy packings of graphs (Q2001970) (← links)
- Resolution of the Oberwolfach problem (Q2039583) (← links)
- Dense Eulerian graphs are \((1, 3)\)-choosable (Q2152793) (← links)
- Progress towards Nash-Williams' conjecture on triangle decompositions (Q2221932) (← links)
- Countable homogeneous Steiner triple systems avoiding specified subsystems (Q2229200) (← links)
- Constructions and uses of incomplete pairwise balanced designs (Q2334435) (← links)
- On the decomposition threshold of a given graph (Q2338634) (← links)
- Clique decompositions of multipartite graphs and completion of Latin squares (Q2363362) (← links)
- Fractional clique decompositions of dense graphs and hypergraphs (Q2407383) (← links)
- Packing spanning graphs from separable families (Q2628001) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A blow-up lemma for approximate decompositions (Q4633567) (← links)
- Sharp bounds for decomposing graphs into edges and triangles (Q4993262) (← links)
- Leaves for packings with block size four (Q5000309) (← links)
- Minimalist designs (Q5120741) (← links)
- On the Minimum Degree Required for a Triangle Decomposition (Q5218438) (← links)
- Fractional Clique Decompositions of Dense Partite Graphs (Q5373835) (← links)
- Transversal factors and spanning trees (Q5871277) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- Fractional cycle decompositions in hypergraphs (Q6052479) (← links)
- Threshold for Steiner triple systems (Q6173554) (← links)
- On determining when small embeddings of partial Steiner triple systems exist (Q6187453) (← links)
- Graph and hypergraph packing (Q6198635) (← links)