The following pages link to On the structure of linear graphs (Q5842850):
Displaying 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)
- Correlation among runners and some results on the lonely runner conjecture (Q278889) (← links)
- The number of \(C_{2\ell}\)-free graphs (Q291780) (← links)
- Ramsey numbers of a fixed odd-cycle and generalized books and fans (Q294540) (← links)
- Embedding tetrahedra into quasirandom hypergraphs (Q326814) (← links)
- Unique low rank completability of partially filled matrices (Q326825) (← links)
- Extremal results for random discrete structures (Q350549) (← links)
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions (Q375770) (← links)
- Color the cycles (Q383778) (← links)
- On the Turán number of forests (Q396789) (← links)
- Maximum planar subgraphs in dense graphs (Q396794) (← links)
- Turán numbers of bipartite graphs plus an odd cycle (Q402594) (← links)
- Some extremal problems for hereditary properties of graphs (Q405091) (← links)
- The extremal function for partial bipartite tilings (Q412273) (← links)
- Minimum \(H\)-decompositions of graphs: edge-critical case (Q414645) (← links)
- Evidence for a forbidden configuration conjecture: One more case solved (Q442404) (← links)
- 3-uniform hypergraphs avoiding a given odd cycle (Q452824) (← links)
- On possible Turán densities (Q466081) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
- Extremal results for odd cycles in sparse pseudorandom graphs (Q484999) (← links)
- Forbidden configurations and product constructions (Q489298) (← links)
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity (Q490983) (← links)
- Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (Q512562) (← links)
- An analogue of the Erdős-Stone theorem for finite geometries (Q520023) (← links)
- Forbidden Berge hypergraphs (Q521388) (← links)
- A tournament approach to pattern avoiding matrices (Q522321) (← links)
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic (Q524192) (← links)
- More results on Ramsey-Turán type problems (Q594896) (← links)
- On the density of a graph and its blowup (Q602726) (← links)
- Pan-\(H\)-linked graphs (Q604671) (← links)
- The number of \(K_{m,m}\)-free graphs (Q653990) (← links)
- On the chromatic number of \(H\)-free graphs of large minimum degree (Q659735) (← links)
- A neighborhood condition which implies the existence of a complete multipartite subgraph (Q685590) (← links)
- Excluding induced subgraphs. II: Extremal graphs (Q686271) (← links)
- A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs (Q697080) (← links)
- Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
- Variations on the theme of repeated distances (Q756139) (← links)
- Bandwidth theorem for random graphs (Q765187) (← links)
- On an extremal problem in graph theory. (Q775325) (← links)
- Supersaturated graphs and hypergraphs (Q787158) (← links)
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures (Q794664) (← links)
- On substructure densities of hypergraphs (Q844225) (← links)
- A note on the jumping constant conjecture of Erdős (Q864899) (← links)
- Non-jumping numbers for 4-uniform hypergraphs (Q878060) (← links)
- Using Lagrangians of hypergraphs to find non-jumping numbers. II. (Q879390) (← links)
- Turán's theorem for pseudo-random graphs (Q880006) (← links)
- An exact Turán result for tripartite 3-graphs (Q888608) (← links)
- The maximal length of a gap between \(r\)-graph Turán densities (Q888628) (← links)
- The critical number of dense triangle-free binary matroids (Q896002) (← links)
