The following pages link to (Q5548826):
Displayed 50 items.
- On the algebraic and topological structure of the set of Turán densities (Q256996) (← links)
- A problem of Erdős and Sós on 3-graphs (Q273102) (← links)
- Extremal graph for intersecting odd cycles (Q286112) (← links)
- Ramsey numbers of a fixed odd-cycle and generalized books and fans (Q294540) (← links)
- Turán number of generalized triangles (Q346455) (← links)
- Combinatorial theorems in sparse random sets (Q350550) (← links)
- A note on Turán numbers for even wheels (Q367087) (← links)
- Color the cycles (Q383778) (← links)
- On the Turán number of forests (Q396789) (← links)
- On the independence numbers of the cubes of odd cycles (Q396806) (← links)
- Turán numbers of bipartite graphs plus an odd cycle (Q402594) (← links)
- Some extremal problems for hereditary properties of graphs (Q405091) (← links)
- Extremal problems for the \(p\)-spectral radius of graphs (Q405309) (← links)
- Hypergraphs with many Kneser colorings (Q412274) (← links)
- Minimum \(H\)-decompositions of graphs: edge-critical case (Q414645) (← links)
- An extension of Turán's theorem, uniqueness and stability (Q463041) (← links)
- On possible Turán densities (Q466081) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
- Counting substructures. II: Hypergraphs (Q485550) (← links)
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity (Q490983) (← links)
- Comparable pairs in families of sets (Q490990) (← links)
- Hypergraph containers (Q496210) (← links)
- Supersaturation problem for color-critical graphs (Q505915) (← links)
- The critical window for the classical Ramsey-Turán problem (Q520045) (← links)
- The fine structure of octahedron-free graphs (Q631642) (← links)
- The structure of almost all graphs in a hereditary property (Q631643) (← links)
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971) (← links)
- Turán numbers for disjoint copies of graphs (Q659740) (← links)
- Excluding induced subgraphs. II: Extremal graphs (Q686271) (← links)
- An analytic approach to stability (Q710597) (← links)
- A stability theorem for maximal \(K_{r+1}\)-free graphs (Q723887) (← links)
- A coloring problem for intersecting vector spaces (Q738847) (← links)
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures (Q794664) (← links)
- A new generalization of Mantel's theorem to \(k\)-graphs (Q885302) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q895997) (← links)
- On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite (Q932657) (← links)
- Disjoint unions of complete minors (Q941374) (← links)
- Constructions of non-principal families in extremal hypergraph theory (Q941382) (← links)
- Ramsey goodness and generalized stars (Q976142) (← links)
- Unit distances and diameters in Euclidean spaces (Q1006401) (← links)
- Set systems with union and intersection constraints (Q1026003) (← links)
- Two-regular subgraphs of hypergraphs (Q1026004) (← links)
- Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\) (Q1044999) (← links)
- Turán's theorem inverted (Q1045153) (← links)
- On the number of edge disjoint cliques in graphs of given size (Q1180425) (← links)
- On graphs \(G\) for which all large trees are \(G\)-good (Q1313348) (← links)
- The extremal graph problem of the icosahedron (Q1394239) (← links)
- On the number of edges not covered by monochromatic copies of a fixed graph. (Q1425108) (← links)
- Stability results for graphs with a critical edge (Q1671746) (← links)
- Some extremal results on complete degenerate hypergraphs (Q1679346) (← links)