Question

How to prove Graph with $n$ vertices has Edge Chromatic Number no more than $n/2$ edges

score 606 · Answer 1 · 2020-01-29 08:09:00

606

Views

How to prove Graph with $n$ vertices has Edge Chromatic Number no more than $n/2$ edges

Published on 29 Jan 2020 - 8:09

score 909 · Answer 2 · 2026-03-25 15:58:35

909

Views

Proof that every even complete graph has a perfect matching

Published on 25 Mar 2026 - 15:58

score 103 · Answer 3 · 2026-05-16 05:25:24

103

Views

Need help understand this theorem of decision trees

Published on 16 May 2026 - 5:25

score 312 · Answer 4 · 2026-04-14 05:54:33

312

Views

How many edges can you add to a tree with $n$ vertices so it stays planar?

Published on 14 Apr 2026 - 5:54

score 366 · Answer 5 · 2026-05-11 09:28:40

366

Views

Max flow in simple weighted graph with no specified source or sink

Published on 11 May 2026 - 9:28

score 340 · Answer 6 · 2026-04-15 20:51:17

340

Views

Show that $G$ has a Hamiltonian cycle

Published on 15 Apr 2026 - 20:51

score 225 · Answer 7 · 2026-03-25 16:01:44

225

Views

Counting bipartite maximum matchings with distinct subsets of vertices

Published on 25 Mar 2026 - 16:01

score 73 · Answer 8 · 2026-03-25 15:57:17

73

Views

Ununderstood Tutte's theorem proof

Published on 25 Mar 2026 - 15:57

score 180 · Answer 9 · 2026-04-15 17:07:52

180

Views

The set of Systems of Distinct Representatives in a finite universe

Published on 15 Apr 2026 - 17:07

score 178 · Answer 10 · 2026-04-14 12:15:38

178

Views

Is the class of all finite graphs a set or a proper class in ZF?

Published on 14 Apr 2026 - 12:15

score 535 · Answer 11 · 2026-05-16 23:42:56

535

Views

Introduction to Graph Theory

Published on 16 May 2026 - 23:42

score 756 · Answer 12 · 2026-04-10 05:01:24

756

Views

Basic explanation of Havel-Hakimi

Published on 10 Apr 2026 - 5:01

score 309 · Answer 13 · 2026-04-12 15:54:13

309

Views

Projection between graphs extends to a covering space

Published on 12 Apr 2026 - 15:54

score 209 · Answer 14 · 2026-04-14 14:45:12

209

Views

Is there a use for undirected graphs defined by ternary relations?

Published on 14 Apr 2026 - 14:45

score 160 · Answer 15 · 2026-04-17 06:06:52

160

Views

Number of non-isomorphic simple graphs whose degrees of all vertices is less than or equal to $2$

Published on 17 Apr 2026 - 6:06

List Question

How to prove Graph with $n$ vertices has Edge Chromatic Number no more than $n/2$ edges

Proof that every even complete graph has a perfect matching

Need help understand this theorem of decision trees

How many edges can you add to a tree with $n$ vertices so it stays planar?

Max flow in simple weighted graph with no specified source or sink

Show that $G$ has a Hamiltonian cycle

Counting bipartite maximum matchings with distinct subsets of vertices

Ununderstood Tutte's theorem proof

The set of Systems of Distinct Representatives in a finite universe

Is the class of all finite graphs a set or a proper class in ZF?

Introduction to Graph Theory

Basic explanation of Havel-Hakimi

Projection between graphs extends to a covering space

Is there a use for undirected graphs defined by ternary relations?

Number of non-isomorphic simple graphs whose degrees of all vertices is less than or equal to $2$

Trending Questions

Popular # Hahtags

Popular Questions