Question

Dense triangle free graphs with paths of length 3 between every pair of vertices

score 219 · Answer 1 · 2017-10-26 16:04:49

219

Views

Dense triangle free graphs with paths of length 3 between every pair of vertices

Published on 26 Oct 2017 - 16:04

score 867 · Answer 2 · 2017-10-27 11:15:49

867

Views

Is the complete graph $K_n$ $n-1$-connected?

Published on 27 Oct 2017 - 11:15

score 217 · Answer 3 · 2017-11-03 11:47:02

217

Views

Problem on Extremal Graphs: three independent paths

Published on 03 Nov 2017 - 11:47

score 43 · Answer 4 · 2017-11-12 12:19:44

43

Views

H is a cycle with an extra chord. $(A,B)$ be a partition of $V(H)$. Then unless H is bipartite, $H$ contains paths of every length

Published on 12 Nov 2017 - 12:19

score 614 · Answer 5 · 2017-11-17 14:09:53

614

Views

Maximum number of edges in a graph where length of every cycle is a multiple of 3

Published on 17 Nov 2017 - 14:09

score 47 · Answer 6 · 2017-11-18 19:20:19

47

Views

Extremal graph in euclidean space

Published on 18 Nov 2017 - 19:20

score 1k · Answer 7 · 2017-12-08 01:45:25

1k

Views

Find the smallest number of edges that a 3-regular graph of girth 4 can have

Published on 08 Dec 2017 - 1:45

score 849 · Answer 8 · 2026-03-25 23:35:50

849

Views

Graphs: Minimum Cycle Basis generated by Horton's algorithm is not consistent

Published on 25 Mar 2026 - 23:35

score 204 · Answer 9 · 2017-12-26 16:27:55

204

Views

Distinguishing vertex, edge, and edge-contraction critical graphs

Published on 26 Dec 2017 - 16:27

score 95 · Answer 10 · 2026-03-22 05:25:47

95

Views

Integer partition refinement, with minimal refinements

Published on 22 Mar 2026 - 5:25

score 99 · Answer 11 · 2026-03-26 23:10:58

99

Views

Prove that $R(Q_d) \leq 2^{3d}$, where $R(Q_d)$ is the Ramsey number of the $d$-dimensional hypercube $Q_d$.

Published on 26 Mar 2026 - 23:10

score 84 · Answer 12 · 2026-03-22 11:07:31

84

Views

Does there exist any other graph class that has as many maximal cliques as Moon–Moser graphs?

Published on 22 Mar 2026 - 11:07

score 147 · Answer 13 · 2026-03-22 06:25:04

147

Views

What makes extremal problems in graph theory interesting?

Published on 22 Mar 2026 - 6:25

score 1k · Answer 14 · 2026-03-22 00:11:11

1k

Views

Let $A$ be a binary $n \times n$ matrix, such that $A^2=0$. What is the max num of $1$'s that $A$ could have?

Published on 22 Mar 2026 - 0:11

score 88 · Answer 15 · 2026-03-21 16:18:23

88

Views

Question about Turán's extremal theorem

Published on 21 Mar 2026 - 16:18

List Question

Dense triangle free graphs with paths of length 3 between every pair of vertices

Is the complete graph $K_n$ $n-1$-connected?

Problem on Extremal Graphs: three independent paths

H is a cycle with an extra chord. $(A,B)$ be a partition of $V(H)$. Then unless H is bipartite, $H$ contains paths of every length

Maximum number of edges in a graph where length of every cycle is a multiple of 3

Extremal graph in euclidean space

Find the smallest number of edges that a 3-regular graph of girth 4 can have

Graphs: Minimum Cycle Basis generated by Horton's algorithm is not consistent

Distinguishing vertex, edge, and edge-contraction critical graphs

Integer partition refinement, with minimal refinements

Prove that $R(Q_d) \leq 2^{3d}$, where $R(Q_d)$ is the Ramsey number of the $d$-dimensional hypercube $Q_d$.

Does there exist any other graph class that has as many maximal cliques as Moon–Moser graphs?

What makes extremal problems in graph theory interesting?

Let $A$ be a binary $n \times n$ matrix, such that $A^2=0$. What is the max num of $1$'s that $A$ could have?

Question about Turán's extremal theorem

Trending Questions

Popular # Hahtags

Popular Questions