Pages that link to "Item:Q385035"
From MaRDI portal
The following pages link to Improved bounds for Erdős' matching conjecture (Q385035):
Displaying 50 items.
- On the size of 3-uniform linear hypergraphs (Q396731) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Generalization of Erdős-Gallai edge bound (Q458592) (← 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)
- Random Kneser graphs and hypergraphs (Q668022) (← 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)
- Turán problems for vertex-disjoint cliques in multi-partite hypergraphs (Q785799) (← links)
- Intersection theorems for multisets (Q896069) (← links)
- Proof of the Erdős matching conjecture in a new range (Q1686318) (← links)
- On maximal tail probability of sums of nonnegative, independent and identically distributed random variables (Q1687185) (← links)
- A degree version of the Hilton-Milner theorem (Q1689057) (← links)
- Families with no matchings of size \(s\) (Q1689961) (← links)
- The junta method in extremal hypergraph theory and Chvátal's conjecture (Q1689997) (← 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)
- On a biased edge isoperimetric inequality for the discrete cube (Q1713503) (← links)
- On the random version of the Erdős matching conjecture (Q1720300) (← links)
- \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges (Q1733864) (← links)
- A generalization of Erdős' matching conjecture (Q1753109) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- On non-trivial families without a perfect matching (Q2011158) (← links)
- Erdős-Ko-Rado theorems on the weak Bruhat lattice (Q2026320) (← links)
- Beyond the Erdős matching conjecture (Q2033940) (← links)
- Old and new applications of Katona's circle (Q2033941) (← links)
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- On the arithmetic mean of the size of cross-union families (Q2043692) (← links)
- Tight bounds for Katona's shadow intersection theorem (Q2048364) (← links)
- On the size of the product of overlapping families (Q2084272) (← links)
- Maximum size of a graph with given fractional matching number (Q2088698) (← links)
- On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427) (← links)
- A note on exact minimum degree threshold for fractional perfect matchings (Q2124789) (← links)
- Size and structure of large \((s,t)\)-union intersecting families (Q2138583) (← links)
- On the sum of sizes of overlapping families (Q2166287) (← links)
- Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
- The Erdős matching conjecture and concentration inequalities (Q2171025) (← links)
- Stability for vertex isoperimetry in the cube (Q2200919) (← links)
- The maximum number of cliques in hypergraphs without large matchings (Q2205126) (← links)
- Non-trivial \(d\)-wise intersecting families (Q2221841) (← links)
- Structure of the largest subgraphs of \(G_{n , p}\) with a given matching number (Q2222927) (← links)
- On the size of shadow-added intersecting families (Q2225446) (← links)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry (Q2279508) (← links)
- On the maximum size of subfamilies of labeled set with given matching number (Q2279764) (← 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)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Erdős-Ko-Rado type theorems for simplicial complexes (Q2363100) (← links)
