List questions from extremal-graph-theory

Published on 22 Mar 2026 - 22:01

156

Views

Turan density results for 4- or 5- graphs

Published on 25 Mar 2026 - 12:48

38

Views

The disjoint cliques problem for complete graphs.

Published on 22 Mar 2026 - 22:16

136

Views

If $G$ is any n-vertex triangle free graph not containing a copy of $D_d$, then $e(G) \leq n(d-1)$

Published on 25 Mar 2026 - 11:16

171

Views

Using extremal graph theory theorem to prove a theorem in planar graphs

Published on 23 Mar 2026 - 9:27

184

Views

Find minimal set of edges in k-partite graph that every k-clique has an edge from this set.

Published on 23 Mar 2026 - 0:47

84

Views

Upper bound on the number of edges of a ten vertexes graph no $C_4, C_3$ subgraph.

Published on 22 Mar 2026 - 23:39

77

Views

A minimal graph cover by its induced cliques

Published on 22 Mar 2026 - 23:49

297

Views

Lower bound of number of independent sets

Published on 25 Mar 2026 - 11:15

26

Views

A question related to Extremal Principle

Published on 25 Mar 2026 - 16:00

88

Views

Generalized Ramsey numbers, possibly infinite?

Published on 25 Mar 2026 - 16:06

192

Views

How do I apply the infinite Ramsey theorem to graph theory?

Published on 25 Mar 2026 - 7:43

241

Views

Can the vertices of a planar graph of min degree 3 be covered with edges of average weight ( sum of degrees) at most 13?

Published on 25 Mar 2026 - 14:46

182

Views

Using Turan's theorem to calculate a bound for triangle free graphs.

Published on 23 Mar 2026 - 5:00

231

Views

Smallest $r$-regular graph with girth at least $n$.

Published on 22 Mar 2026 - 20:45

List Question

Problem on graphs with more edge than a Turan number

Turan density results for 4- or 5- graphs

The disjoint cliques problem for complete graphs.

If $G$ is any n-vertex triangle free graph not containing a copy of $D_d$, then $e(G) \leq n(d-1)$

Using extremal graph theory theorem to prove a theorem in planar graphs

Find minimal set of edges in k-partite graph that every k-clique has an edge from this set.

Upper bound on the number of edges of a ten vertexes graph no $C_4, C_3$ subgraph.

A minimal graph cover by its induced cliques

Lower bound of number of independent sets

A question related to Extremal Principle

Generalized Ramsey numbers, possibly infinite?

How do I apply the infinite Ramsey theorem to graph theory?

Can the vertices of a planar graph of min degree 3 be covered with edges of average weight ( sum of degrees) at most 13?

Using Turan's theorem to calculate a bound for triangle free graphs.

Smallest $r$-regular graph with girth at least $n$.

Trending Questions

Popular # Hahtags

Popular Questions