Pages that link to "Item:Q3462543"
From MaRDI portal
The following pages link to Fractional Triangle Decompositions in Graphs with Large Minimum Degree (Q3462543):
Displaying 17 items.
- Triangle decompositions of planar graphs (Q726643) (← links)
- Resolution of the Oberwolfach problem (Q2039583) (← links)
- Completion and deficiency problems (Q2200922) (← links)
- Progress towards Nash-Williams' conjecture on triangle decompositions (Q2221932) (← 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)
- Sharp bounds for decomposing graphs into edges and triangles (Q4993262) (← 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)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- On the Weisfeiler-Leman dimension of fractional packing (Q5918531) (← links)
- On determining when small embeddings of partial Steiner triple systems exist (Q6187453) (← links)
- Graph and hypergraph packing (Q6198635) (← links)
- Sharp bounds for decomposing graphs into edges and triangles (Q6621162) (← links)
- Resolution of the Oberwolfach problem (Q6621209) (← links)
