Pages that link to "Item:Q2868080"

The following pages link to An upper bound on the number of Steiner triple systems (Q2868080):

Displaying 23 items.

• On the maximum number of Latin transversals (Q272327) (← links)
• Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs (Q322196) (← links)
• On the numbers of 1-factors and 1-factorizations of hypergraphs (Q507504) (← links)
• Counting Steiner triple systems (Q1620862) (← links)
• Thresholds versus fractional expectation-thresholds (Q1983096) (← links)
• Enumerating extensions of mutually orthogonal Latin squares (Q2004974) (← links)
• Counting \(r\)-graphs without forbidden configurations (Q2171019) (← links)
• On a conjecture of Erdős on locally sparse Steiner triple systems (Q2216922) (← links)
• Efficient, local and symmetric Markov chains that generate one-factorizations (Q2216928) (← links)
• Number of 1-factorizations of regular high-degree graphs (Q2220965) (← links)
• On the number of 1-factorizations of a complete graph (Q2352638) (← links)
• A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
• Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480) (← links)
• Enumerating matroids and linear spaces (Q2683212) (← links)
• An Entropy-Based Proof for the Moore Bound for Irregular Graphs (Q2821702) (← links)
• Permanents of multidimensional matrices: Properties and applications (Q2959191) (← links)
• (Q4221704) (← links)
• On the upper embedding of Steiner triple systems and Latin squares (Q4988842) (← links)
• The number of partial Steiner systems and d-partitions (Q5871278) (← links)
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
• Smoothed counting of 0–1 points in polyhedra (Q6051058) (← links)
• The number of \(n\)-queens configurations (Q6098437) (← links)
• Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)