List questions from extremal-graph-theory

Published on 05 May 2026 - 6:19

285

Views

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

Published on 05 May 2026 - 4:16

99

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 04 May 2026 - 4:00

78

Views

Extremal combinatorics problem on graph matching

Published on 05 May 2026 - 5:35

528

Views

How sparse is a graph of bounded treewidth?

Published on 07 May 2026 - 10:52

302

Views

Extremal graph without cycle length $k$ or longer.

Published on 29 Apr 2026 - 12:47

36

Views

projecting antichains to middlemost levels

Published on 18 Apr 2026 - 14:55

526

Views

Extremal graphs definition

Published on 07 May 2026 - 16:54

1.7k

Views

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

Published on 07 May 2026 - 14:53

724

Views

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

Published on 05 May 2026 - 4:12

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 05 May 2026 - 4:10

440

Views

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

Published on 29 Apr 2026 - 12:47

78

Views

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

Published on 29 Apr 2026 - 12:47

88

Views

Materials to read for Graph Theory.

Published on 29 Apr 2026 - 12:47

111

Views

On properties of extremal graphs

Published on 29 Apr 2026 - 12:46

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