Pages that link to "Item:Q2171025"
From MaRDI portal
The following pages link to The Erdős matching conjecture and concentration inequalities (Q2171025):
Displaying 33 items.
- Improved bounds for Erdős' matching conjecture (Q385035) (← links)
- Rainbow matchings in properly-colored hypergraphs (Q668047) (← links)
- Economical tight examples for the biased Erdős-Selfridge theorem (Q932605) (← links)
- The maximum number of disjoint pairs in a family of subsets (Q1066898) (← links)
- Proof of the Erdős matching conjecture in a new range (Q1686318) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- On non-trivial families without a perfect matching (Q2011158) (← links)
- Beyond the Erdős matching conjecture (Q2033940) (← links)
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- Maximum size of a graph with given fractional matching number (Q2088698) (← links)
- A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs (Q2092337) (← links)
- On the sum of sizes of overlapping families (Q2166287) (← links)
- Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
- Remarks on the Erdős matching conjecture for vector spaces (Q2662794) (← links)
- A better bound on the size of rainbow matchings (Q2680820) (← links)
- Erdős matching conjecture for almost perfect matchings (Q2685338) (← links)
- Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
- A Stability Result on Matchings in 3-Uniform Hypergraphs (Q5043638) (← links)
- Rainbow version of the Erdős Matching Conjecture via concentration (Q5886247) (← links)
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs (Q6046825) (← links)
- Rainbow spanning structures in graph and hypergraph systems (Q6052079) (← links)
- Extremal Problem for Matchings and Rainbow Matchings on Direct Products (Q6077978) (← links)
- Improved bound on vertex degree version of Erdős matching conjecture (Q6081573) (← links)
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs (Q6081575) (← links)
- Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs (Q6098072) (← links)
- Families with restricted matching number and multiply covered shadows (Q6177434) (← links)
- A proof of Frankl's conjecture on cross-union families (Q6179324) (← links)
- On a Conjecture of Feige for Discrete Log-Concave Distributions (Q6187075) (← links)
- Trivial colors in colorings of Kneser graphs (Q6197737) (← links)
- A proof of Frankl–Kupavskii's conjecture on edge‐union condition (Q6201033) (← links)
- Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs (Q6568850) (← links)
- Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs (Q6635102) (← links)