Question

Proving that every edge in a graph must belong to a $K_4$

score 240 · Answer 1 · 2026-04-14 01:33:00

240

Views

Proving that every edge in a graph must belong to a $K_4$

Published on 14 Apr 2026 - 1:33

score 228 · Answer 2 · 2026-04-16 13:19:50

228

Views

Combinatoric Graph

Published on 16 Apr 2026 - 13:19

score 62 · Answer 3 · 2026-04-16 13:58:22

62

Views

If a graph $G=\left<V,E\right>$ is connected and $\left|E\right|=\left|V\right|$ then there's a circle in $G$

Published on 16 Apr 2026 - 13:58

score 180 · Answer 4 · 2026-05-04 22:58:55

180

Views

Hall's marriage problem, graph theoretic version

Published on 04 May 2026 - 22:58

score 830 · Answer 5 · 2026-04-17 12:20:37

830

Views

Example of non-isomorphic regular graphs which differ on a set of three vertices

Published on 17 Apr 2026 - 12:20

score 237 · Answer 6 · 2026-04-17 15:20:53

Suppose the complement $\overline {G}$ of $G$ has size $\overline{m}$. Show that either $m >1/2 (nC2)$ or $\overline{m}>1/2(nC2)$

score 343 · Answer 7 · 2026-04-16 13:42:31

Show that for each integer $n\geq 2$. there is exactly one bipartite graph order $n$ size $\lfloor n^2/4 \rfloor$

score 1.8k · Answer 8 · 2026-04-15 12:25:22

1.8k

Views

Strong Triadic Closure and Nodes that Violate/satisfy it

Published on 15 Apr 2026 - 12:25

score 288 · Answer 9 · 2026-04-13 00:31:09

288

Views

Prove that if all costs are proportional to distances, then a shortest tour cannot intersect itself.

Published on 13 Apr 2026 - 0:31

score 252 · Answer 10 · 2026-04-15 20:52:33

252

Views

Show that joining of 2 self complement graph is another self complement graph.

Published on 15 Apr 2026 - 20:52

score 93 · Answer 11 · 2026-04-16 15:41:55

93

Views

Number of trees on a vertex set $\lbrace{1,2,\ldots,7\rbrace}.$

Published on 16 Apr 2026 - 15:41

score 84 · Answer 12 · 2026-04-16 09:24:41

84

Views

Representing distances in high-dimensional space

Published on 16 Apr 2026 - 9:24

score 59 · Answer 13 · 2026-04-08 18:51:32

59

Views

Need help formulating a Traveling Salesman (Deliveryman) Variation

Published on 08 Apr 2026 - 18:51

score 50 · Answer 14 · 2026-04-12 22:50:06

50

Views

Prove one of the eigenvector entries has the smallest magnitude

Published on 12 Apr 2026 - 22:50

score 519 · Answer 15 · 2026-04-14 18:19:50

519

Views

provide a combinatorial proof that $C_{n+1} = C_0C_n + C_1C_{n-1} + …. + C_kC_{n-k} + …C_nC_0$

Published on 14 Apr 2026 - 18:19

List Question

Proving that every edge in a graph must belong to a $K_4$

Combinatoric Graph

If a graph $G=\left<V,E\right>$ is connected and $\left|E\right|=\left|V\right|$ then there's a circle in $G$

Hall's marriage problem, graph theoretic version

Example of non-isomorphic regular graphs which differ on a set of three vertices

Suppose the complement $\overline {G}$ of $G$ has size $\overline{m}$. Show that either $m >1/2 (nC2)$ or $\overline{m}>1/2(nC2)$

Show that for each integer $n\geq 2$. there is exactly one bipartite graph order $n$ size $\lfloor n^2/4 \rfloor$

Strong Triadic Closure and Nodes that Violate/satisfy it

Prove that if all costs are proportional to distances, then a shortest tour cannot intersect itself.

Show that joining of 2 self complement graph is another self complement graph.

Number of trees on a vertex set $\lbrace{1,2,\ldots,7\rbrace}.$

Representing distances in high-dimensional space

Need help formulating a Traveling Salesman (Deliveryman) Variation

Prove one of the eigenvector entries has the smallest magnitude

provide a combinatorial proof that $C_{n+1} = C_0C_n + C_1C_{n-1} + …. + C_kC_{n-k} + …C_nC_0$

Trending Questions

Popular # Hahtags

Popular Questions