List questions from extremal-graph-theory

Published on 25 Mar 2026 - 22:09

135

Views

Construction of a graph $G$ with $\lvert V(G)\rvert = 13$ vertices and minimum degree of every vertex $\delta_0 = 3$ aiming to maximize its diameter

Published on 12 Jul 2023 - 13:22

73

Views

A question on the proof of Erdős, Kleitman and Rothschild

Published on 15 Jul 2023 - 14:16

138

Views

Minimum & maximum options for simple graph connected component

Published on 20 Jul 2023 - 10:25

25

Views

Graphs with large diameters and small clique numbers

Published on 22 Jul 2023 - 19:09

183

Views

Maximum number of sizes of maximal cliques for a graph?

Published on 03 Aug 2023 - 2:54

89

Views

Large chromatic number implies a clique (weakened Hadwiger's conjecture)

Published on 03 Aug 2023 - 6:31

34

Views

Edge colouring distinguishing by sums for a complete graph

Published on 28 Aug 2023 - 13:11

12

Views

What's the $p$-th power of a $k$-uniform tight cycle?

Published on 19 Mar 2026 - 13:11

18

Views

Maximal planar graphs with minimum independent sets

Published on 20 Mar 2026 - 5:47

239

Views

Why does a 3-regular planar graph of diameter 3 have at most 12 vertices?

Published on 18 Sep 2023 - 13:08

124

Views

Maximum number of vertices with degree three in maximal bipartite planar graphs

Published on 25 Sep 2023 - 11:06

104

Views

Minimum vertex number that admits linear $d$-regular $k$-uniform hypergraph

Published on 25 Mar 2026 - 10:52

58

Views

Lower bound for couples of disjoint sets in some partitions of the power set

Published on 27 Sep 2023 - 9:45

60

Views

Maximum number of edges in a Line Graph L(G)

Published on 03 Oct 2023 - 21:18

List Question

An extremal problem concerning sizes and connectivity.

Construction of a graph $G$ with $\lvert V(G)\rvert = 13$ vertices and minimum degree of every vertex $\delta_0 = 3$ aiming to maximize its diameter

A question on the proof of Erdős, Kleitman and Rothschild

Minimum & maximum options for simple graph connected component

Graphs with large diameters and small clique numbers

Maximum number of sizes of maximal cliques for a graph?

Large chromatic number implies a clique (weakened Hadwiger's conjecture)

Edge colouring distinguishing by sums for a complete graph

What's the $p$-th power of a $k$-uniform tight cycle?

Maximal planar graphs with minimum independent sets

Why does a 3-regular planar graph of diameter 3 have at most 12 vertices?

Maximum number of vertices with degree three in maximal bipartite planar graphs

Minimum vertex number that admits linear $d$-regular $k$-uniform hypergraph

Lower bound for couples of disjoint sets in some partitions of the power set

Maximum number of edges in a Line Graph L(G)

Trending Questions

Popular # Hahtags

Popular Questions