Pages that link to "Item:Q850084"
From MaRDI portal
The following pages link to Perfect matchings in uniform hypergraphs with large minimum degree (Q850084):
Displaying 43 items.
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641) (← links)
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs (Q439060) (← links)
- Forbidding Hamilton cycles in uniform hypergraphs (Q530769) (← links)
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees (Q641543) (← links)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (Q859609) (← links)
- Perfect matchings in 4-uniform hypergraphs (Q896007) (← links)
- A note on perfect matchings in uniform hypergraphs (Q907268) (← links)
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs (Q965258) (← links)
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree (Q1014811) (← links)
- Perfect matchings in large uniform hypergraphs with large minimum collective degree (Q1024365) (← 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)
- \(d\)-matching in 3-uniform hypergraphs (Q1690241) (← links)
- \(K_r\)-factors in graphs with low independence number (Q1998757) (← links)
- Matching in 3-uniform hypergraphs (Q1999738) (← links)
- Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs (Q2023735) (← links)
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- A note on exact minimum degree threshold for fractional perfect matchings (Q2124789) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Vertex degree sums for matchings in 3-uniform hypergraphs (Q2327218) (← links)
- Families of triples with high minimum degree are Hamiltonian (Q2450131) (← links)
- Perfect matchings in \(r\)-partite \(r\)-graphs (Q2519794) (← links)
- Fractional and integer matchings in uniform hypergraphs (Q2637239) (← links)
- Co-degree density of hypergraphs (Q2642025) (← links)
- (Q2857450) (← 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)
- d-matching in k-uniform hypergraphs (Q4597954) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three (Q4908832) (← links)
- Nearly Perfect Matchings in Uniform Hypergraphs (Q4990402) (← links)
- Matching of Given Sizes in Hypergraphs (Q5043636) (← links)
- Rainbow Perfect Matchings for 4-Uniform Hypergraphs (Q5093585) (← links)
- Near Perfect Matchings in<i>k</i>-Uniform Hypergraphs (Q5364253) (← links)
- Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs (Q5419939) (← links)
- A geometric theory for hypergraph matching (Q5497101) (← links)
- Hypergraphs without non-trivial intersecting subgraphs (Q5886354) (← links)
- Co-degree threshold for rainbow perfect matchings in uniform hypergraphs (Q6051049) (← links)
- Vertex degree sums for matchings in 3-uniform hypergraphs (Q6494941) (← links)
