Pages that link to "Item:Q2883857"

The following pages link to On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size (Q2883857):

Displayed 21 items.

• Regular subgraphs of uniform hypergraphs (Q273181) ‎ (← links)
• Improved bounds for Erdős' matching conjecture (Q385035) ‎ (← links)
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels (Q423641) ‎ (← links)
• On the maximum number of edges in a hypergraph with given matching number (Q516783) ‎ (← links)
• The minimum number of disjoint pairs in set systems and related problems (Q524186) ‎ (← links)
• Rainbow matchings in properly-colored hypergraphs (Q668047) ‎ (← links)
• Turán problems for vertex-disjoint cliques in multi-partite hypergraphs (Q785799) ‎ (← links)
• A short proof of Erdős' conjecture for triple systems (Q1701428) ‎ (← links)
• The size of 3-uniform hypergraphs with given matching number and codegree (Q1712519) ‎ (← links)
• A generalization of Erdős' matching conjecture (Q1753109) ‎ (← links)
• The Erdős matching conjecture and concentration inequalities (Q2171025) ‎ (← links)
• On the maximum size of subfamilies of labeled set with given matching number (Q2279764) ‎ (← 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)
• 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)
• The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs (Q2629296) ‎ (← links)
• A Stability Result on Matchings in 3-Uniform Hypergraphs (Q5043638) ‎ (← links)
• Rainbow version of the Erdős Matching Conjecture via concentration (Q5886247) ‎ (← links)
• Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs (Q6098072) ‎ (← links)