Pages that link to "Item:Q2368590"
From MaRDI portal
The following pages link to Proof of a conjecture of Erdős on triangles in set-systems (Q2368590):
Displaying 40 items.
- Turán problems and shadows. II: Trees (Q345098) (← links)
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- Set systems without a simplex or a cluster (Q532128) (← links)
- A product version of the Erdős-Ko-Rado theorem (Q533340) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- Set systems without a 3-simplex (Q641176) (← links)
- The maximum size of intersecting and union families of sets (Q657996) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Note on set systems without a strong simplex (Q968446) (← links)
- On a packing and covering problem (Q1058516) (← links)
- Triangle free sets and arithmetic progressions---two Pisier type problems (Q1597783) (← 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)
- On the theories of triangular sets (Q1808664) (← links)
- Partitioning ordered hypergraphs (Q2005178) (← links)
- On set systems without a simplex-cluster and the junta method (Q2010639) (← links)
- The Erdős-Hajnal conjecture for three colors and triangles (Q2113341) (← links)
- New results on simplex-clusters in set systems (Q2236657) (← links)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
- Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles (Q2259279) (← links)
- Minimal paths and cycles in set systems (Q2372429) (← links)
- An intersection theorem for four sets (Q2383002) (← links)
- Multiply-intersecting families revisited (Q2384803) (← links)
- Hypergraph Turán numbers of linear cycles (Q2434896) (← links)
- On a problem of Erdős and Rothschild on edges in triangles (Q2448958) (← links)
- The maximum measure of 3-wise \(t\)-intersecting families (Q2701004) (← links)
- An arithmetic analogue of Fox's triangle removal argument (Q2789638) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q2851439) (← links)
- On <i>r</i>-Cross Intersecting Families of Sets (Q3103624) (← links)
- Structure and stability of triangle-free set systems (Q3420310) (← links)
- Simplex Stability (Q3557500) (← links)
- Problems and results in combinatorial analysis and combinatorial number theory (Q3856779) (← links)
- (Q4023746) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951) (← links)
- Turán Problems and Shadows III: Expansions of Graphs (Q5254084) (← links)
- Appendix: Solution of Burnashev’s Problem and a Sharpening of the Erdős/Ko/Rado Theorem (Q5504241) (← links)
- Hypergraphs without non-trivial intersecting subgraphs (Q5886354) (← links)
- On Turán numbers for disconnected hypergraphs (Q6111798) (← links)
- On Multicolor Ramsey Numbers of Triple System Paths of Length 3 (Q6170440) (← links)
