Counting designs
From MaRDI portal
Publication:1746198
DOI10.4171/JEMS/779zbMath1386.05015arXiv1504.02909OpenAlexW3037839091MaRDI QIDQ1746198
Publication date: 24 April 2018
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.02909
Combinatorial aspects of block designs (05B05) Triple systems (05B07) Graph designs and isomorphic decomposition (05C51)
Related Items (55)
On the maximum number of Latin transversals ⋮ Hypergraphs without non-trivial intersecting subgraphs ⋮ Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Counting Steiner triple systems ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Unnamed Item ⋮ Shattering and more: Extending the complete object ⋮ Euler tours in hypergraphs ⋮ Counting \(r\)-graphs without forbidden configurations ⋮ Almost all optimally coloured complete graphs contain a rainbow Hamilton path ⋮ Substructures in Latin squares ⋮ Smoothed counting of 0–1 points in polyhedra ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ On a problem of Erdős and Moser ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Hamilton transversals in random Latin squares ⋮ Enumerating coprime permutations ⋮ Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles ⋮ The number of \(n\)-queens configurations ⋮ Enumerating matroids and linear spaces ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ Large deviations in random latin squares ⋮ Unnamed Item ⋮ Perfectly packing graphs with bounded degeneracy and many leaves ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Threshold for Steiner triple systems ⋮ Matroid Horn functions ⋮ Graph and hypergraph packing ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ EXISTENCE OF -ANALOGS OF STEINER SYSTEMS ⋮ Minimalist designs ⋮ Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families ⋮ Steiner loops of affine type ⋮ Unnamed Item ⋮ On a conjecture of Erdős on locally sparse Steiner triple systems ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Almost all Steiner triple systems are almost resolvable ⋮ Coloured and Directed Designs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Thresholds versus fractional expectation-thresholds ⋮ Enumerating matroids of fixed rank ⋮ The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class ⋮ Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs ⋮ On extremal hypergraphs for forests of tight paths ⋮ Large sets with multiplicity ⋮ Resolution of the Oberwolfach problem ⋮ Large girth approximate Steiner triple systems ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ Unnamed Item ⋮ Pseudorandom hypergraph matchings ⋮ Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma ⋮ Constructions and uses of incomplete pairwise balanced designs ⋮ Random Steiner systems and bounded degree coboundary expanders of every dimension ⋮ The number of partial Steiner systems and d-partitions ⋮ Local balance in graph decompositions
This page was built for publication: Counting designs
