Question

How to interpret the intuitive idea behind Szemerédi regularity lemma?

score 59 · Answer 1 · 2026-03-25 23:37:18

59

Views

How to interpret the intuitive idea behind Szemerédi regularity lemma?

Published on 25 Mar 2026 - 23:37

score 180 · Answer 2 · 2019-12-05 17:44:42

180

Views

Smallest $k$-regular unit-distance graph

Published on 05 Dec 2019 - 17:44

score 94 · Answer 3 · 2019-12-14 14:49:50

94

Views

Extreme points and directions

Published on 14 Dec 2019 - 14:49

score 180 · Answer 4 · 2026-03-26 02:57:39

180

Views

For the multicolour Ramsey numbers, prove that $R_r(t_1,t_2,...,t_r) \leq r^{1 + \sum_{i=1}^r (t_i - 1)}$.

Published on 26 Mar 2026 - 2:57

score 625 · Answer 5 · 2019-12-26 14:06:14

625

Views

Upper bound for monochromatic edges in vertex coloring with k colors

Published on 26 Dec 2019 - 14:06

score 456 · Answer 6 · 2019-12-27 05:54:24

456

Views

The number of edges when girth is large

Published on 27 Dec 2019 - 5:54

score 228 · Answer 7 · 2026-03-26 02:55:11

228

Views

Deduce the finite Ramsey theorem from the infinite case.

Published on 26 Mar 2026 - 2:55

score 682 · Answer 8 · 2026-03-26 02:56:00

682

Views

Maximum number of cycles of length $4$

Published on 26 Mar 2026 - 2:56

score 88 · Answer 9 · 2026-03-26 02:55:11

88

Views

Maximum clique in intersection graph of $3$-element subsets of a $9$-element set?

Published on 26 Mar 2026 - 2:55

score 907 · Answer 10 · 2026-03-26 02:57:46

907

Views

Coloring $\mathbb{N}$ with finitely many colors results in monochromatic $x,y,z \in \mathbb{N}$ such that $x+y = z$.

Published on 26 Mar 2026 - 2:57

score 65 · Answer 11 · 2026-03-26 03:12:21

65

Views

Canonical Ramsey theorem in $m$-uniform setting admits $2^m$ canonical colorings.

Published on 26 Mar 2026 - 3:12

score 69 · Answer 12 · 2026-03-25 06:22:07

69

Views

For $t \geq 3$, if $n \geq R^{(3)}(t,t)$, then n points in $\mathbb{R}^2$ always contain either t collinear points, or t points in convex position.

Published on 25 Mar 2026 - 6:22

score 177 · Answer 13 · 2020-01-28 01:08:34

177

Views

What additional properties does a finite $k$-partite graph have if the endpoints of every edge have a common neighbor in each independent set?

Published on 28 Jan 2020 - 1:08

score 168 · Answer 14 · 2020-02-01 11:13:52

168

Views

Given a graph $G$, prove that $m(G) \ge n(G) - c(G) $

Published on 01 Feb 2020 - 11:13

score 94 · Answer 15 · 2026-03-26 04:36:38

94

Views

Cups and caps inequality: $f(s,t) \leq {s+t-2 \choose {s-2}}+1$

Published on 26 Mar 2026 - 4:36

List Question

How to interpret the intuitive idea behind Szemerédi regularity lemma?

Smallest $k$-regular unit-distance graph

Extreme points and directions

For the multicolour Ramsey numbers, prove that $R_r(t_1,t_2,...,t_r) \leq r^{1 + \sum_{i=1}^r (t_i - 1)}$.

Upper bound for monochromatic edges in vertex coloring with k colors

The number of edges when girth is large

Deduce the finite Ramsey theorem from the infinite case.

Maximum number of cycles of length $4$

Maximum clique in intersection graph of $3$-element subsets of a $9$-element set?

Coloring $\mathbb{N}$ with finitely many colors results in monochromatic $x,y,z \in \mathbb{N}$ such that $x+y = z$.

Canonical Ramsey theorem in $m$-uniform setting admits $2^m$ canonical colorings.

For $t \geq 3$, if $n \geq R^{(3)}(t,t)$, then n points in $\mathbb{R}^2$ always contain either t collinear points, or t points in convex position.

What additional properties does a finite $k$-partite graph have if the endpoints of every edge have a common neighbor in each independent set?

Given a graph $G$, prove that $m(G) \ge n(G) - c(G) $

Cups and caps inequality: $f(s,t) \leq {s+t-2 \choose {s-2}}+1$

Trending Questions

Popular # Hahtags

Popular Questions