Pages that link to "Item:Q5889065"
From MaRDI portal
The following pages link to The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065):
Displayed 27 items.
- Resolution of the Oberwolfach problem (Q2039583) (← links)
- On a conjecture of Erdős on locally sparse Steiner triple systems (Q2216922) (← links)
- Packing degenerate graphs (Q2324574) (← links)
- Constructions and uses of incomplete pairwise balanced designs (Q2334435) (← links)
- Probabilistic existence of regular combinatorial structures (Q2400828) (← links)
- Euler tours in hypergraphs (Q2658380) (← links)
- A Short proof of the blow-up lemma for approximate decompositions (Q2678455) (← links)
- Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families (Q4611006) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree (Q5039053) (← links)
- Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles (Q5106710) (← links)
- Minimalist designs (Q5120741) (← links)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
- Hypergraphs Not Containing a Tight Tree with a Bounded Trunk (Q5232133) (← links)
- On asymptotic packing of convex geometric and ordered graphs (Q6062874) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- The number of \(n\)-queens configurations (Q6098437) (← links)
- Independence numbers of Johnson-type graphs (Q6115445) (← links)
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)
- Coloring unions of nearly disjoint hypergraph cliques (Q6144279) (← links)
- Constructions of pairs of orthogonal latin cubes (Q6146762) (← links)
- Perfectly packing graphs with bounded degeneracy and many leaves (Q6165180) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
- Threshold for Steiner triple systems (Q6173554) (← links)
- Packing cliques in 3‐uniform hypergraphs (Q6187456) (← links)
- Graph and hypergraph packing (Q6198635) (← links)