All Questions

Filter by
Sorted by
Tagged with
4 votes
1 answer
317 views

Construction of graphs of high girth and chromatic number

Are there any concrete constructions of graphs of both high girth and chromatic number? Of course there is the seminal paper of Erdős which proves the existence of such graphs via the probabilistic ...
Felix Schröder's user avatar
-5 votes
2 answers
231 views

Is a single randomly generated graph sufficient to prove an almost all colorability result?

I have generated a single random 17th degree 100 vertex graph, with self-loops and multiple edges rerandomized out of existence, so the graph is highly 17 regular, and after long computation with a ...
daniel pehoushek's user avatar