Question

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

score 136 · Answer 1 · 2026-03-25 11:16:27

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

score 72 · Answer 2 · 2026-04-07 05:09:55

72

Views

If $|E(G)|\ge(k-1)|V(G)|$ then $G$ has a subgraph $H$ such that $\delta(H)\ge k$ for $k\ge 2$

Published on 07 Apr 2026 - 5:09

score 96 · Answer 3 · 2026-03-27 12:13:49

96

Views

Combinatorics: Existence of a Latin Square

Published on 27 Mar 2026 - 12:13

score 370 · Answer 4 · 2026-03-25 15:40:11

370

Views

Let G be a graph with largest eigenvalue λ and largest degree ∆. Prove that λ ≥ √ ∆.

Published on 25 Mar 2026 - 15:40

score 1.5k · Answer 5 · 2026-03-25 11:03:45

1.5k

Views

Show that the largest eigenvalue of a graph is strictly larger than the largest eigenvalue of any subgraph

Published on 25 Mar 2026 - 11:03

score 49 · Answer 6 · 2026-03-25 06:11:15

49

Views

Quasigroup from a finite projective plane order 2

Published on 25 Mar 2026 - 6:11

score 191 · Answer 7 · 2019-04-04 12:55:25

191

Views

Deleting path from a bridgeless graph

Published on 04 Apr 2019 - 12:55

score 545 · Answer 8 · 2026-03-25 01:34:50

545

Views

Basic questions about Laplacian matrices in graph theory

Published on 25 Mar 2026 - 1:34

score 293 · Answer 9 · 2026-03-25 01:38:28

293

Views

Explanation in a step of proving the positive semidefinite property of the graph Laplacian

Published on 25 Mar 2026 - 1:38

score 403 · Answer 10 · 2026-03-25 12:50:53

403

Views

Prove: $[k+y-1-v]{v \choose k}\geq \sum_{j=0}^a(-1)^j \left( \sum_{i=0}^k{v-i \choose k-i}r_i(j)\right)+\epsilon(a,k,p)$

Published on 25 Mar 2026 - 12:50

score 35 · Answer 11 · 2019-04-04 22:12:53

35

Views

Computing product/sum of scores on a matrix game

Published on 04 Apr 2019 - 22:12

score 70 · Answer 12 · 2026-03-25 09:40:01

70

Views

Matching students with books, such that each student matches k books and each book matches k students

Published on 25 Mar 2026 - 9:40

score 213 · Answer 13 · 2026-03-25 11:10:18

213

Views

confused about generalized ramsey numbers

Published on 25 Mar 2026 - 11:10

score 84 · Answer 14 · 2026-03-26 19:59:40

84

Views

Arranging playdate groups

Published on 26 Mar 2026 - 19:59

score 44 · Answer 15 · 2019-04-05 17:45:02

44

Views

Can a planar graph G have $f>m$? (f- faces, and m-edges)

Published on 05 Apr 2019 - 17:45

List Question

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

If $|E(G)|\ge(k-1)|V(G)|$ then $G$ has a subgraph $H$ such that $\delta(H)\ge k$ for $k\ge 2$

Combinatorics: Existence of a Latin Square

Let G be a graph with largest eigenvalue λ and largest degree ∆. Prove that λ ≥ √ ∆.

Show that the largest eigenvalue of a graph is strictly larger than the largest eigenvalue of any subgraph

Quasigroup from a finite projective plane order 2

Deleting path from a bridgeless graph

Basic questions about Laplacian matrices in graph theory

Explanation in a step of proving the positive semidefinite property of the graph Laplacian

Prove: $[k+y-1-v]{v \choose k}\geq \sum_{j=0}^a(-1)^j \left( \sum_{i=0}^k{v-i \choose k-i}r_i(j)\right)+\epsilon(a,k,p)$

Computing product/sum of scores on a matrix game

Matching students with books, such that each student matches k books and each book matches k students

confused about generalized ramsey numbers

Arranging playdate groups

Can a planar graph G have $f>m$? (f- faces, and m-edges)

Trending Questions

Popular # Hahtags

Popular Questions