The following pages link to On matchings in hypergraphs (Q456292):
Displaying 50 items.
- Improved bounds for Erdős' matching conjecture (Q385035) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- On the maximum number of edges in a hypergraph with given matching number (Q516783) (← links)
- Monochromatic matchings in the shadow graph of almost complete hypergraphs (Q659584) (← links)
- Rainbow matchings in properly-colored hypergraphs (Q668047) (← links)
- Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- The clique complex and hypergraph matching (Q873650) (← links)
- Intersection theorems for multisets (Q896069) (← links)
- Matchings in infinite graphs (Q1101134) (← links)
- Extensions of Gallai's graph covering theorems for uniform hypergraphs (Q1179466) (← links)
- Proof of the Erdős matching conjecture in a new range (Q1686318) (← links)
- Extremal hypergraphs for matching number and domination number (Q1693167) (← links)
- Resilient hypergraphs with fixed matching number (Q1715070) (← links)
- On the random version of the Erdős matching conjecture (Q1720300) (← links)
- A generalization of Erdős' matching conjecture (Q1753109) (← links)
- On non-trivial families without a perfect matching (Q2011158) (← links)
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427) (← links)
- Matching orderable and separable hypergraphs (Q2136876) (← links)
- Size and structure of large \((s,t)\)-union intersecting families (Q2138583) (← links)
- On the size of shadow-added intersecting families (Q2225446) (← links)
- On the maximum size of subfamilies of labeled set with given matching number (Q2279764) (← links)
- Mixed matchings in graphs (Q2279983) (← links)
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman (Q2312621) (← links)
- Existence of a maximum balanced matching in the hypercube (Q2320869) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture (Q2397107) (← links)
- Matching and domination numbers in \(r\)-uniform hypergraphs (Q2410114) (← links)
- Hypergraph Turán numbers of linear cycles (Q2434896) (← links)
- On Erdős' extremal problem on matchings in hypergraphs (Q2439573) (← links)
- Linear trees in uniform hypergraphs (Q2509754) (← links)
- On the maximum number of edges in hypergraphs with fixed matching and clique number (Q2674562) (← links)
- A better bound on the size of rainbow matchings (Q2680820) (← links)
- On matchings in graphs (Q2713637) (← links)
- The size of a hypergraph and its matching number (Q2888870) (← links)
- Matching critical intersection hypergraphs (Q2968611) (← links)
- Santa claus meets hypergraph matchings (Q3189065) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
- (Q3576703) (← links)
- Matchings in Graphs Variations of the Problem (Q3611943) (← links)
- The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249) (← links)
- (Q3726165) (← links)
- Disjoint perfect matchings in 3‐uniform hypergraphs (Q4575532) (← links)
- On Rainbow Matchings for Hypergraphs (Q4602861) (← links)
- A stochastic matching model on hypergraphs (Q5013243) (← links)
- A Stability Result on Matchings in 3-Uniform Hypergraphs (Q5043638) (← links)
- Rainbow Perfect Matchings for 4-Uniform Hypergraphs (Q5093585) (← links)
- (Q5417726) (← links)
- Matchings in hypergraphs of large minimum degree (Q5469026) (← links)
