List questions from extremal-graph-theory

Published on 20 Mar 2026 - 3:23

279

Views

$6$-regular graph of order $25$ and diameter $2$

Published on 20 Mar 2026 - 4:44

88

Views

Given a graph with n vertices, if it have more than $\frac{nt}{2}$ edges then there exists a simple path of length $t+1$.

Published on 17 Mar 2026 - 19:22

71

Views

Extremal combinatorics problem on graph matching

Published on 17 Mar 2026 - 14:31

521

Views

How sparse is a graph of bounded treewidth?

Published on 20 Mar 2026 - 0:18

298

Views

Extremal graph without cycle length $k$ or longer.

Published on 20 Mar 2026 - 2:26

32

Views

projecting antichains to middlemost levels

Published on 20 Mar 2026 - 12:00

516

Views

Extremal graphs definition

Published on 20 Mar 2026 - 2:40

1.6k

Views

Lower bound for the Ramsey number $R(3,t)$

Published on 19 Mar 2026 - 18:16

715

Views

Help with induction for graph with no path of length $k$

Published on 22 Mar 2026 - 3:53

1.6k

Views

Prove that a graph with $100$ vertices with each edge having degree at most $4$ contains an empty graph of order $20$.

Published on 22 Mar 2026 - 5:51

435

Views

There is two triangles with common edge in graph $\Gamma$

Published on 25 Mar 2026 - 8:37

71

Views

Show that the limit of the density of the Turán graph T(r,n) is 1-1/r+O(1).

Published on 22 Mar 2026 - 15:30

79

Views

Materials to read for Graph Theory.

Published on 25 Mar 2026 - 5:24

106

Views

On properties of extremal graphs

Published on 25 Mar 2026 - 6:02

List Question

Maximum Number of Edges in a Graph Without a Cycle of length $4$

$6$-regular graph of order $25$ and diameter $2$

Given a graph with n vertices, if it have more than $\frac{nt}{2}$ edges then there exists a simple path of length $t+1$.

Extremal combinatorics problem on graph matching

How sparse is a graph of bounded treewidth?

Extremal graph without cycle length $k$ or longer.

projecting antichains to middlemost levels

Extremal graphs definition

Lower bound for the Ramsey number $R(3,t)$

Help with induction for graph with no path of length $k$

Prove that a graph with $100$ vertices with each edge having degree at most $4$ contains an empty graph of order $20$.

There is two triangles with common edge in graph $\Gamma$

Show that the limit of the density of the Turán graph T(r,n) is 1-1/r+O(1).

Materials to read for Graph Theory.

On properties of extremal graphs

Trending Questions

Popular # Hahtags

Popular Questions