Timeline for Construction of graphs of high girth and chromatic number
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 26 at 15:05 | vote | accept | Felix Schröder | ||
| Jun 21, 2022 at 12:34 | answer | added | Tony Huynh | timeline score: 3 | |
| S Jun 21, 2022 at 12:08 | history | suggested | CommunityBot | CC BY-SA 4.0 |
fixed small error, added additional research material
|
| Jun 21, 2022 at 12:08 | comment | added | Felix Schröder | I just found a very similar question actually on Mathematics Stack Exchange: math.stackexchange.com/questions/1489355/… | |
| Jun 21, 2022 at 12:07 | comment | added | Felix Schröder | Thanks for the quick references, the generalized Mycielskians unfortunately contain $C_4$ though if the original graph contains a vertex of degree at least 2. I'll look into the Ramanujan graph construction, it looks promising on a first look. | |
| Jun 21, 2022 at 11:53 | review | Suggested edits | |||
| S Jun 21, 2022 at 12:08 | |||||
| Jun 20, 2022 at 16:25 | comment | added | Manfred Weis | certain Ramanujan graphs have large girth and chromatic number; a constrution is described here | |
| Jun 20, 2022 at 10:18 | comment | added | ho boon suan | The generalized Mycielski construction might help with Q1: en.wikipedia.org/wiki/Mycielskian#Cones_over_graphs | |
| S Jun 20, 2022 at 9:47 | review | First questions | |||
| Jun 20, 2022 at 11:11 | |||||
| S Jun 20, 2022 at 9:47 | history | asked | Felix Schröder | CC BY-SA 4.0 |