Pages that link to "Item:Q1024365"

The following pages link to Perfect matchings in large uniform hypergraphs with large minimum collective degree (Q1024365):

Displaying 45 items.

• 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)
• On Perfect Matchings in <i>k</i>-Complexes (Q3382619) (← links)
• (Q3568712) (← links)
• Perfect matchings in random uniform hypergraphs (Q4434467) (← links)
• New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help (Q4500484) (← links)
• d-matching in k-uniform hypergraphs (Q4597954) (← links)
• Almost Perfect Matchings in $k$-Partite $k$-Graphs (Q4605443) (← links)
• On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
• Partial Steiner systems and matchings in hypergraphs (Q4705347) (← links)
• Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three (Q4908832) (← links)
• On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem (Q4959763) (← links)
• Nearly Perfect Matchings in Uniform Hypergraphs (Q4990402) (← links)
• Pseudorandom hypergraph matchings (Q4993112) (← links)
• Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs (Q4993132) (← links)
• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)
• Covering and tiling hypergraphs with tight cycles (Q4993263) (← links)
• All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight) (Q4997139) (← links)
• Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
• Matchings in <i>k</i>‐partite <i>k</i>‐uniform hypergraphs (Q5066909) (← links)
• Minimum Vertex Degree Threshold for ‐tiling* (Q5265336) (← links)
• Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles (Q5270411) (← links)
• Near Perfect Matchings in<i>k</i>-Uniform Hypergraphs (Q5364253) (← links)
• On Directed Versions of the Hajnal–Szemerédi Theorem (Q5364261) (← links)
• Perfect Packings in Quasirandom Hypergraphs II (Q5366906) (← links)
• Minimum Codegree Threshold for<i>C</i>₆³-Factors in 3-Uniform Hypergraphs (Q5366961) (← links)
• Exact Minimum Codegree Threshold for <i>K</i>⁻₄-Factors (Q5373833) (← links)
• Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs (Q5419939) (← links)
• Matchings in hypergraphs of large minimum degree (Q5469026) (← links)
• A geometric theory for hypergraph matching (Q5497101) (← links)
• Counting Hamilton cycles in Dirac hypergraphs (Q5886103) (← links)
• Embedding clique-factors in graphs with low \(\ell\)-independence number (Q6038592) (← links)
• Graph Tilings in Incompatibility Systems (Q6046822) (← links)
• Co-degree threshold for rainbow perfect matchings in uniform hypergraphs (Q6051049) (← links)
• Clique-factors in graphs with sublinear -independence number (Q6064154) (← links)
• Improved bound on vertex degree version of Erdős matching conjecture (Q6081573) (← links)
• A Ramsey–Turán theory for tilings in graphs (Q6185051) (← links)
• Vertex degree sums for matchings in 3-uniform hypergraphs (Q6494941) (← links)
• A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems (Q6603918) (← links)
• \(H\)-factors in graphs with small independence number (Q6615761) (← links)
• On powers of Hamilton cycles in Ramsey-Turán theory (Q6622733) (← links)
• A note on color-bias perfect matchings in hypergraphs (Q6622736) (← links)
• Compatible powers of Hamilton cycles in dense graphs (Q6657592) (← links)
• Transversal Hamilton cycle in hypergraph systems (Q6668348) (← links)