Skip to main content

Timeline for Kneser graph with overlap

Current License: CC BY-SA 3.0

16 events
when toggle format what by license comment
Oct 11, 2018 at 20:16 vote accept pi66
S Jul 26, 2017 at 22:50 history bounty ended CommunityBot
S Jul 26, 2017 at 22:50 history notice removed CommunityBot
Jul 24, 2017 at 22:35 history edited pi66 CC BY-SA 3.0
added 137 characters in body
Jul 22, 2017 at 20:56 comment added domotorp This thing has been called the "discrete Borsuk graph" in this unpublished manuscript: dcg.epfl.ch/files/content/sites/dcg/files/users/… For results related to the continuous version, we of course have ams.org/mathscinet-getitem?mr=708798.
Jul 20, 2017 at 17:28 history edited pi66 CC BY-SA 3.0
added 42 characters in body; edited tags
S Jul 18, 2017 at 21:06 history bounty started pi66
S Jul 18, 2017 at 21:06 history notice added pi66 Draw attention
Jul 17, 2017 at 12:42 history edited pi66
edited tags
Jul 14, 2017 at 12:10 history edited pi66 CC BY-SA 3.0
deleted 4 characters in body
Jul 14, 2017 at 0:50 history edited pi66 CC BY-SA 3.0
edited tags
Jul 14, 2017 at 0:43 comment added Gjergji Zaimi It seems that this graph always has chromatic number 6. It's easy to see that 6 colors suffice since the vertex set can be written as a disjoint union of two parts each of which induces a Kneser graph with chromatic number 3. Following Lovasz' original proof, my claim would follow if we can also prove that the neighborhood simplicial complex of your graph is 3-connected. This seems to be true but I haven't been able to come up with a proof yet. However it suggests adding the algebraic topology tag.
Jul 13, 2017 at 23:41 history edited pi66 CC BY-SA 3.0
deleted 108 characters in body
Jul 13, 2017 at 14:05 history edited pi66 CC BY-SA 3.0
added 173 characters in body
Jul 11, 2017 at 6:14 answer added Aaron Dall timeline score: 2
Jul 10, 2017 at 21:10 history asked pi66 CC BY-SA 3.0