The following pages link to Counting designs (Q1746198):
Displaying 50 items.
- On the maximum number of Latin transversals (Q272327) (← links)
- Enumerating matroids of fixed rank (Q510313) (← links)
- Counting Steiner triple systems (Q1620862) (← links)
- On a problem of Erdős and Moser (Q1688260) (← links)
- Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs (Q1756034) (← links)
- Thresholds versus fractional expectation-thresholds (Q1983096) (← links)
- Large sets with multiplicity (Q2035460) (← links)
- Resolution of the Oberwolfach problem (Q2039583) (← links)
- Local balance in graph decompositions (Q2115139) (← links)
- Shattering and more: Extending the complete object (Q2144328) (← links)
- Counting \(r\)-graphs without forbidden configurations (Q2171019) (← links)
- Steiner loops of affine type (Q2210805) (← links)
- On a conjecture of Erdős on locally sparse Steiner triple systems (Q2216922) (← links)
- The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class (Q2243892) (← links)
- On extremal hypergraphs for forests of tight paths (Q2279249) (← links)
- Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma (Q2333832) (← links)
- Constructions and uses of incomplete pairwise balanced designs (Q2334435) (← links)
- Random Steiner systems and bounded degree coboundary expanders of every dimension (Q2334503) (← links)
- Euler tours in hypergraphs (Q2658380) (← links)
- Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480) (← links)
- A Short proof of the blow-up lemma for approximate decompositions (Q2678455) (← links)
- Enumerating matroids and linear spaces (Q2683212) (← links)
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS (Q2971026) (← links)
- Coloured and Directed Designs (Q3295270) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- (Q3300708) (← 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)
- (Q5000306) (← 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)
- The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) (Q5108704) (← links)
- Minimalist designs (Q5120741) (← links)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
- Almost all Steiner triple systems are almost resolvable (Q5135409) (← links)
- (Q5139693) (← links)
- Large girth approximate Steiner triple systems (Q5217914) (← links)
- Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles (Q5222560) (← links)
- Perfect Packings in Quasirandom Hypergraphs II (Q5366906) (← links)
- The number of partial Steiner systems and d-partitions (Q5871278) (← links)
- Hypergraphs without non-trivial intersecting subgraphs (Q5886354) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- Substructures in Latin squares (Q6050265) (← links)
- Smoothed counting of 0–1 points in polyhedra (Q6051058) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- Hamilton transversals in random Latin squares (Q6074871) (← links)
- Enumerating coprime permutations (Q6074974) (← links)
- The number of \(n\)-queens configurations (Q6098437) (← links)
- Large deviations in random latin squares (Q6133414) (← links)
- On loose 3-cycle decompositions of complete 4-uniform hypergraphs (Q6134955) (← links)
