Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 9137

Vertex colouring, Edge Colouring, List Colouring, Fractional Chromatic Number and other variants of graph colouring problems are all on topic.

3 votes

Chromatic number of $C_4$-free graphs

For the second question with respect to maximum degree, a bound of the desired form was first observed by Alon, Krivelevich and Sudakov (see https://doi.org/10.1006/jctb.1999.1910, Cor 2.4). My collea …
RJK's user avatar
  • 214
1 vote

Generalization of independence complex of graphs

To add to my previous answer, a paper of Szabó and Tardos from 2006 ("Extremal problems for transversals in graphs with bounded degree") has a result related to the complex you defined in 2.
RJK's user avatar
  • 214
3 votes
Accepted

Generalization of independence complex of graphs

Although I am not sure if these concepts been studied much as simplicial complexes, at least the second has been studied quite extensively in graph theory and theoretical computer science (including b …
RJK's user avatar
  • 214