User Louis D

12 votes

11 answers

2k views

Giving a math talk with no blackboard or projector

asked Sep 14, 2011 at 17:17

8 votes

1 answer

163 views

Replacing maximum degree with degeneracy in Reed's conjecture

asked Oct 30, 2020 at 20:51

6 votes

1 answer

194 views

Graphs with linear Ramsey number for two colors, but super-linear Ramsey number for three colors?

asked Mar 3, 2021 at 21:14

4 votes

1 answer

274 views

Dominating sets in subtournaments of the Paley tournament

asked Feb 5, 2021 at 20:56

4 votes

1 answer

134 views

Replacing maximum degree with degeneracy in Brooks' theorem

asked Nov 5, 2020 at 20:18

4 votes

3 answers

781 views

Does there exist a finite hyperbolic geometry in which every line contains at least 3 points, but not every line contains the same number of points?

asked Jan 20, 2017 at 22:00

4 votes

1 answer

371 views

When is it true that if $G$ is isomorphic to a spanning subgraph of $H$ and vice versa, then $G$ is isomorphic to $H$?

asked Jul 29, 2020 at 19:32

4 votes

2 answers

257 views

Relationship between minimum vertex cover and matching width

asked Sep 30, 2020 at 17:20

3 votes

2 answers

340 views

A direct proof that every $r$-colored complete graph on $n=(r+1)m-(r-1)$ vertices has a monochromatic matching of size $m$?

asked May 4, 2018 at 14:40

3 votes

1 answer

304 views

Perfect matchings in infinite regular bipartite graphs

asked Nov 6, 2020 at 17:49

3 votes

2 answers

2k views

Proving that every strongly connected tournament T on at least 4 vertices contains distinct vertices u, v such that T-u and T-v are strongly connected

asked Dec 1, 2020 at 16:58

Stack Exchange Network

11 Questions

Giving a math talk with no blackboard or projector

Replacing maximum degree with degeneracy in Reed's conjecture

Graphs with linear Ramsey number for two colors, but super-linear Ramsey number for three colors?

Dominating sets in subtournaments of the Paley tournament

Replacing maximum degree with degeneracy in Brooks' theorem

Does there exist a finite hyperbolic geometry in which every line contains at least 3 points, but not every line contains the same number of points?

When is it true that if $G$ is isomorphic to a spanning subgraph of $H$ and vice versa, then $G$ is isomorphic to $H$?

Relationship between minimum vertex cover and matching width

A direct proof that every $r$-colored complete graph on $n=(r+1)m-(r-1)$ vertices has a monochromatic matching of size $m$?

Perfect matchings in infinite regular bipartite graphs

Proving that every strongly connected tournament T on at least 4 vertices contains distinct vertices u, v such that T-u and T-v are strongly connected