Pages that link to "Item:Q423641"
From MaRDI portal
The following pages link to Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641):
Displaying 50 items.
- Improved bounds for Erdős' matching conjecture (Q385035) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Perfect matchings in 3-partite 3-uniform hypergraphs (Q406558) (← links)
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations (Q414653) (← links)
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs (Q439060) (← links)
- Hamilton cycles in dense vertex-transitive graphs (Q462925) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
- Forbidding Hamilton cycles in uniform hypergraphs (Q530769) (← links)
- Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) (← links)
- Perfect matchings in 4-uniform hypergraphs (Q896007) (← links)
- A note on perfect matchings in uniform hypergraphs (Q907268) (← links)
- Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs (Q1633862) (← links)
- Vertex degree sums for perfect matchings in 3-uniform hypergraphs (Q1671670) (← links)
- On maximal tail probability of sums of nonnegative, independent and identically distributed random variables (Q1687185) (← links)
- \(d\)-matching in 3-uniform hypergraphs (Q1690241) (← links)
- A generalization of Erdős' matching conjecture (Q1753109) (← links)
- Near-perfect clique-factors in sparse pseudorandom graphs (Q1792104) (← links)
- Matching in 3-uniform hypergraphs (Q1999738) (← links)
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- Maximum size of a graph with given fractional matching number (Q2088698) (← links)
- On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427) (← links)
- On the \(A_\alpha\)-spectral radius of graphs without large matchings (Q2091147) (← links)
- A note on exact minimum degree threshold for fractional perfect matchings (Q2124789) (← links)
- Dirac-type theorems in random hypergraphs (Q2131868) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets (Q2206734) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
- Degree versions of theorems on intersecting families via stability (Q2326331) (← links)
- Vertex degree sums for matchings in 3-uniform hypergraphs (Q2327218) (← links)
- A linear bound on the Manickam-Miklós-Singhi conjecture (Q2347887) (← links)
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs (Q2349508) (← links)
- Fractional matchings in hypergraphs (Q2355661) (← links)
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture (Q2397107) (← links)
- Fractional and integer matchings in uniform hypergraphs (Q2637239) (← links)
- A better bound on the size of rainbow matchings (Q2680820) (← links)
- Erdős matching conjecture for almost perfect matchings (Q2685338) (← links)
- How to Poison Your Mother-in-Law, and Other Caching Problems (Q2961402) (← links)
- Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs (Q2975787) (← links)
- Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture (Q3178439) (← links)
- Near Perfect Matchings in ${k}$-Uniform Hypergraphs II (Q3185658) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- (Q4558081) (← links)
- On Rainbow Matchings for Hypergraphs (Q4602861) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Perfect matchings in random s‐uniform hypergraphs (Q4847395) (← links)
- Nearly Perfect Matchings in Uniform Hypergraphs (Q4990402) (← links)
- Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
- A Stability Result on Matchings in 3-Uniform Hypergraphs (Q5043638) (← links)
