The following pages link to Extremal problems in graph theory (Q5543308):
Displaying 50 items.
- Deterministic improved round-trip spanners (Q2410583) (← links)
- An Erdős-Gallai-type theorem for keyrings (Q2413630) (← links)
- The Erdős-Sós conjecture for spiders (Q2462374) (← links)
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (Q2509762) (← links)
- Multi-color Ramsey numbers of even cycles (Q2519800) (← links)
- On some extremal problems on \(r\)-graphs (Q2544168) (← links)
- On a Turán-type hypergraph problem of Brown, Erdős and T. Sós (Q2566157) (← links)
- Degree conditions for forests in graphs (Q2581630) (← links)
- On the structure of linear graphs (Q2627011) (← links)
- Source-wise round-trip spanners (Q2628274) (← links)
- Extremal problems for multigraphs (Q2668012) (← links)
- Turán problems for \(k\)-geodetic digraphs (Q2689115) (← links)
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor (Q2700634) (← links)
- Selected Topics in the Extremal Graph Theory (Q2951735) (← links)
- Extremal problems for cycles in graphs (Q2957176) (← links)
- (Q3104256) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Simple Distributed Spanners in Dense Congest Networks (Q3297775) (← links)
- (Q3315539) (← links)
- (Q3728934) (← links)
- (Q4410007) (← links)
- A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- Extremal Numbers of Cycles Revisited (Q4988275) (← links)
- Turán numbers of theta graphs (Q4993102) (← links)
- Distance-Preserving Graph Contractions (Q4993321) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- (Q5091190) (← links)
- EXTREMAL THEORY OF ORDERED GRAPHS (Q5122154) (← links)
- Maximum and Minimum Degree Conditions for Embedding Trees (Q5128507) (← links)
- Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← links)
- Extremal theory of vertex or edge ordered graphs (Q5149172) (← links)
- Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871) (← links)
- Local Properties via Color Energy Graphs and Forbidden Configurations (Q5208745) (← links)
- The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
- Triple systems with no three triples spanning at most five points (Q5229522) (← links)
- Hypergraphs Not Containing a Tight Tree with a Bounded Trunk (Q5232133) (← links)
- Degree Conditions for Embedding Trees (Q5232383) (← links)
- Distance-Preserving Graph Contractions (Q5233754) (← links)
- (Q5284081) (← links)
- A Problem in Graph Theory (Q5331782) (← links)
- A Bound on the Number of Edges in Graphs Without an Even Cycle (Q5366930) (← links)
- Maximum number of colorings of (2<i>k, k</i><sup>2</sup>)‐graphs (Q5434250) (← links)
- On some new inequalities concerning extremal properties of graphs (Q5544083) (← links)
- An extremal problem in graph theory (Q5578806) (← links)
- Extremal problems in graph theory (Q5728132) (← links)
- (Q5743389) (← links)
- The solution of a certain problem on graphs of P. Turán (Q5821653) (← links)
- (Q5874556) (← links)
