Pages that link to "Item:Q5510578"
From MaRDI portal
The following pages link to A problem on independent \(r\)-tuples (Q5510578):
Displaying 50 items.
- 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)
- Mixed matchings in graphs (Q2279983) (← links)
- Rainbow factors in hypergraphs (Q2299634) (← links)
- Families of finite sets satisfying intersection restrictions (Q2309551) (← 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)
- Vertex degree sums for matchings in 3-uniform hypergraphs (Q2327218) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Erdős-Ko-Rado type theorems for simplicial complexes (Q2363100) (← links)
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture (Q2397107) (← links)
- Structure and supersaturation for intersecting families (Q2420562) (← 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)
- Fractional and integer matchings in uniform hypergraphs (Q2637239) (← links)
- Remarks on the Erdős matching conjecture for vector spaces (Q2662794) (← 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)
- Erdős matching conjecture for almost perfect matchings (Q2685338) (← links)
- High dimensional Hoffman bound and applications in extremal combinatorics (Q2700317) (← links)
- How to Poison Your Mother-in-Law, and Other Caching Problems (Q2961402) (← links)
- The structure of large intersecting families (Q2970053) (← links)
- Erdös–Ko–Rado Theorem—22 Years Later (Q3041202) (← links)
- Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture (Q3178439) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH (Q4103571) (← links)
- (Q4558081) (← links)
- On Rainbow Matchings for Hypergraphs (Q4602861) (← links)
- Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers (Q4610452) (← links)
- Nearly Perfect Matchings in Uniform Hypergraphs (Q4990402) (← links)
- Rainbow matchings in k‐partite hypergraphs (Q4996918) (← links)
- A Stability Result on Matchings in 3-Uniform Hypergraphs (Q5043638) (← links)
- Families with no perfect matchings (Q5048439) (← links)
- A note on fractional covers of a graph (Q5058159) (← links)
- Turán numbers of sunflowers (Q5060342) (← links)
- Rainbow Perfect Matchings for 4-Uniform Hypergraphs (Q5093585) (← links)
- Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems (Q5126774) (← links)
- Simple juntas for shifted families (Q5126777) (← links)
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951) (← links)
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians (Q5366952) (← links)
- Rainbow version of the Erdős Matching Conjecture via concentration (Q5886247) (← links)
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs (Q6046825) (← links)
- Turán numbers for disjoint paths (Q6056755) (← links)
- Extremal Problem for Matchings and Rainbow Matchings on Direct Products (Q6077978) (← links)
- On families with bounded matching number (Q6079296) (← links)
- Improved bound on vertex degree version of Erdős matching conjecture (Q6081573) (← links)
- Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs (Q6098072) (← links)