Pages that link to "Item:Q273102"
From MaRDI portal
The following pages link to A problem of Erdős and Sós on 3-graphs (Q273102):
Displaying 18 items.
- Embedding tetrahedra into quasirandom hypergraphs (Q326814) (← links)
- Note on upper density of quasi-random hypergraphs (Q396781) (← links)
- Inducibility of directed paths (Q785814) (← links)
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle (Q896063) (← links)
- The codegree threshold of \(K_4^-\) (Q1689950) (← links)
- Maximizing five-cycles in \(K_r\)-free graphs (Q2048348) (← links)
- Paths of length three are \(K_{r+1}\)-Turán-good (Q2121716) (← links)
- Extremal problems in uniformly dense hypergraphs (Q2189833) (← links)
- Minimum number of edges that occur in odd cycles (Q2312602) (← links)
- Compactness and finite forcibility of graphons (Q2327712) (← links)
- Rainbow triangles in three-colored graphs (Q2399351) (← links)
- Tournaments, 4-uniform hypergraphs, and an exact extremal result (Q2399352) (← links)
- Tiling multipartite hypergraphs in quasi-random hypergraphs (Q2692780) (← links)
- On the Maximum Quartet Distance between Phylogenetic Trees (Q2800184) (← links)
- C5 ${C}_{5}$ is almost a fractalizer (Q6047976) (← links)
- Uniform Turán density of cycles (Q6112889) (← links)
- F$F$‐factors in Quasi‐random Hypergraphs (Q6134524) (← links)
- Restricted problems in extremal combinatorics (Q6198640) (← links)
