The following pages link to Extremal problems in graph theory (Q5543308):
Displaying 28 items.
- Ramsey-type numbers involving graphs and hypergraphs with large girth (Q5886107) (← links)
- On the Erdős–Sós conjecture for trees with bounded degree (Q5886108) (← links)
- On subspaces contained in subsets of finite homogeneous spaces (Q5904286) (← links)
- Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity (Q6046820) (← links)
- (Q6065466) (← links)
- k-Planar Placement and Packing of Δ-Regular Caterpillars (Q6066468) (← links)
- Ramsey goodness of trees in random graphs (Q6076209) (← links)
- Radius, girth and minimum degree (Q6081551) (← links)
- Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)
- Degree conditions on copies of forests in graphs (Q6093997) (← links)
- Improved lower bounds for multiplicative square-free sequences (Q6117250) (← links)
- Some exact results for regular Turán problems for all large orders (Q6181995) (← links)
- Approximate Steiner (<i>r</i> − 1, <i>r</i>, <i>n</i>)‐systems without three blocks on <i>r</i> + 2 points (Q6185555) (← links)
- Dirac-type conditions for spanning bounded-degree hypertrees (Q6187344) (← links)
- On the Turán number of the hypercube (Q6193735) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)
- On Turán problems with bounded matching number (Q6201023) (← links)
- On an extremal problem for locally sparse multigraphs (Q6201879) (← links)
- On the spectral radius of graphs with given maximum degree and girth (Q6492426) (← links)
- Strong 2-degenerate graph embeddings (Q6551190) (← links)
- On the \((6,4)\)-problem of Brown, Erdős, and Sós (Q6562822) (← links)
- Approximate distance sensitivity oracles in subquadratic space (Q6566476) (← links)
- Exact results on generalized Erdős-Gallai problems (Q6568830) (← links)
- Connected Turán number of trees (Q6619396) (← links)
- Embedding trees with maximum and minimum degree conditions (Q6621161) (← links)
- Generalized Turán problems for even cycles (Q6621207) (← links)
- On extremal problems on multigraphs (Q6640956) (← links)
- Trimming forests is hard (unless they are made of stars) (Q6654119) (← links)
