Question

Which graphs $G$ in which any circle is an edge separator maximize $||G||$ for fixed |G|?

score 74 · Answer 1 · 2026-03-25 17:37:37

74

Views

Which graphs $G$ in which any circle is an edge separator maximize $||G||$ for fixed |G|?

Published on 25 Mar 2026 - 17:37

score 158 · Answer 2 · 2020-07-04 01:10:36

158

Views

Sum related to Goodman's Formula

Published on 04 Jul 2020 - 1:10

score 270 · Answer 3 · 2020-07-04 20:24:11

270

Views

Do sparse graphs contain regular pairs?

Published on 04 Jul 2020 - 20:24

score 143 · Answer 4 · 2026-03-26 04:31:34

143

Views

What is the minimum embedding dimension for a given graph with unit line-segments as edges?

Published on 26 Mar 2026 - 4:31

score 198 · Answer 5 · 2026-03-25 17:41:56

198

Views

Why doesn’t this work: proof for the lower bound of the size $\sigma(k)$ of the smallest tournament with the Schütte property $S_k$?

Published on 25 Mar 2026 - 17:41

score 166 · Answer 6 · 2026-03-25 19:06:50

166

Views

A tournament on $k2^k$ vertices always contains a dominating set of size $k$.

Published on 25 Mar 2026 - 19:06

score 292 · Answer 7 · 2026-03-21 18:41:35

292

Views

Looking for source: Max num of edges of graph with given number of vertices and given girth

Published on 21 Mar 2026 - 18:41

score 69 · Answer 8 · 2026-03-22 01:54:21

69

Views

Combinatorial viewpoint regarding n Points and collinearity

Published on 22 Mar 2026 - 1:54

score 782 · Answer 9 · 2026-03-22 02:01:28

782

Views

Erdos Unit Distance Problem -- Maximal graphs

Published on 22 Mar 2026 - 2:01

score 130 · Answer 10 · 2026-03-22 00:44:35

$\delta(G) \geq (1-\frac 1r + \frac{\varepsilon}{2})n$ implies G contains at least $ (\frac {r \varepsilon n}2)^{r+1}$ copies of $K_{r+1}$

score 280 · Answer 11 · 2026-03-21 21:00:51

280

Views

Deducing this better version of the regularity lemma from the usual one

Published on 21 Mar 2026 - 21:00

score 1k · Answer 12 · 2026-03-22 07:24:31

1k

Views

Turán's theorem proof

Published on 22 Mar 2026 - 7:24

score 55 · Answer 13 · 2026-03-22 12:21:45

55

Views

Prove that $\text{ex}\left(n, \begin{pmatrix} 1 & 1\\ 1 & 1\end{pmatrix}\right) = \Theta(n^{3/2})$.

Published on 22 Mar 2026 - 12:21

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

1k

Views

Necessary and sufficient conditions for regular graphs

Published on 22 Mar 2026 - 11:36

score 381 · Answer 15 · 2026-03-22 01:57:31

381

Views

Defining the smallest integer $k$ such that every graph of minimum degree at least $k$ contains a perfect matching?

Published on 22 Mar 2026 - 1:57

List Question

Which graphs $G$ in which any circle is an edge separator maximize $||G||$ for fixed |G|?

Sum related to Goodman's Formula

Do sparse graphs contain regular pairs?

What is the minimum embedding dimension for a given graph with unit line-segments as edges?

Why doesn’t this work: proof for the lower bound of the size $\sigma(k)$ of the smallest tournament with the Schütte property $S_k$?

A tournament on $k2^k$ vertices always contains a dominating set of size $k$.

Looking for source: Max num of edges of graph with given number of vertices and given girth

Combinatorial viewpoint regarding n Points and collinearity

Erdos Unit Distance Problem -- Maximal graphs

$\delta(G) \geq (1-\frac 1r + \frac{\varepsilon}{2})n$ implies G contains at least $ (\frac {r \varepsilon n}2)^{r+1}$ copies of $K_{r+1}$

Deducing this better version of the regularity lemma from the usual one

Turán's theorem proof

Prove that $\text{ex}\left(n, \begin{pmatrix} 1 & 1\\ 1 & 1\end{pmatrix}\right) = \Theta(n^{3/2})$.

Necessary and sufficient conditions for regular graphs

Defining the smallest integer $k$ such that every graph of minimum degree at least $k$ contains a perfect matching?

Trending Questions

Popular # Hahtags

Popular Questions