Pages that link to "Item:Q4500484"

The following pages link to New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help (Q4500484):

Displayed 13 items.

• Arboricity: an acyclic hypergraph decomposition problem motivated by database theory (Q765344) ‎ (← links)
• On a refinement of Waring's problem (Q1847774) ‎ (← links)
• Piercing random boxes (Q2998893) ‎ (← links)
• When almost all sets are difference dominated (Q3055768) ‎ (← links)
• Computing the Partition Function for Perfect Matchings in a Hypergraph (Q3103630) ‎ (← links)
• Note on asymptotically good packings (Q3578141) ‎ (← links)
• Concentration of non‐Lipschitz functions and applications (Q4537624) ‎ (← links)
• The infamous upper tail (Q4537625) ‎ (← links)
• Long gaps between primes (Q4588341) ‎ (← links)
• A natural barrier in random greedy hypergraph matching (Q5222558) ‎ (← links)
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) ‎ (← links)
• Graph and hypergraph colouring via nibble methods: a survey (Q6086395) ‎ (← links)
• New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) ‎ (← links)