The following pages link to Extremal problems in graph theory (Q5543308):
Displaying 50 items.
- The number of \(C_{2\ell}\)-free graphs (Q291780) (← links)
- Turán problems and shadows. II: Trees (Q345098) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- On the Turán number of forests (Q396789) (← links)
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- Cycles in graphs of fixed girth with large size (Q518183) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q895997) (← links)
- Streaming algorithm for graph spanners-single pass and constant processing time per edge (Q963343) (← links)
- Ramsey partitions and proximity data structures (Q997827) (← links)
- Unit distances and diameters in Euclidean spaces (Q1006401) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s (Q1179469) (← links)
- On graphs which contain all small trees (Q1245238) (← links)
- Induced subgraphs of given sizes (Q1301633) (← links)
- Two extremal problems in graph theory (Q1344395) (← links)
- The extremal graph problem of the icosahedron (Q1394239) (← links)
- Ramsey numbers involving large dense graphs and bipartite Turán numbers (Q1405120) (← links)
- Extremum problems with separable graphs (Q1406307) (← links)
- A condition for a graph to contain \(k\)-matching. (Q1422440) (← links)
- Gaps in the saturation spectrum of trees (Q1630934) (← links)
- Extremal graph theory and finite forcibility (Q1689971) (← links)
- Turán numbers for odd wheels (Q1699569) (← links)
- Degree powers in graphs with a forbidden forest (Q1712530) (← links)
- On the VC-dimension of unique round-trip shortest path systems (Q1730015) (← links)
- Extremal problems on components and loops in graphs (Q1734913) (← links)
- Graph minor hierarchies (Q1764803) (← links)
- Fault-tolerant approximate shortest-path trees (Q1799205) (← links)
- Some remarks on packing trees (Q1838500) (← links)
- Cycles of even length in graphs (Q1844243) (← links)
- The Erdös-Sós conjecture for graphs of girth 5 (Q1916132) (← links)
- General lemmas for Berge-Turán hypergraph problems (Q1987076) (← links)
- An Erdős-Gallai type theorem for vertex colored graphs (Q2000563) (← links)
- A fast algorithm for source-wise round-trip spanners (Q2034785) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Supersaturation for subgraph counts (Q2117531) (← links)
- Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
- Turán numbers for hypergraph star forests (Q2122689) (← links)
- Generalized rainbow Turán problems (Q2144330) (← links)
- Singular Turán numbers and worm-colorings (Q2158187) (← links)
- Generalized Turán problems for even cycles (Q2200921) (← links)
- Sparse hypergraphs: new bounds and constructions (Q2222044) (← links)
- Two graph theoretical problems (Q2227761) (← links)
- Linear Turán numbers of acyclic triple systems (Q2237863) (← links)
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions (Q2264683) (← links)
- On equitable colorings of hypergraphs (Q2291188) (← links)
- Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
- Spanners for bounded tree-length graphs (Q2383601) (← links)
- On some extremal problems in graph theory (Q2396159) (← links)
