Timeline for Bounding chromatic number by a function of independence and clique number
Current License: CC BY-SA 3.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 24, 2017 at 3:07 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
Jun 24, 2017 at 2:23 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
May 25, 2017 at 1:20 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
Apr 25, 2017 at 1:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
Mar 26, 2017 at 0:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
Feb 23, 2017 at 23:01 | comment | added | user36212 | This isn't relevant: all the graph classes which are conjectured (or known) to be $\chi$-bounded are also conjectured or known to have the Erdos-Hajnal property; which in particular means they have only polynomially many vertices in $\max(\alpha(G),\omega(G))$, not exponentially many as for Ramsey graphs or the graphs Paul is interested in. Also, Paul is one of the 'folks like...'. | |
Feb 23, 2017 at 22:59 | answer | added | user36212 | timeline score: 1 | |
Feb 23, 2017 at 13:10 | history | edited | Paul Wollan | CC BY-SA 3.0 |
added 524 characters in body
|
Feb 22, 2017 at 19:54 | comment | added | Pat Devlin | Look into "$\chi$-boundedness" which is an area studied by folks like Paul Seymour and Maria Chudnovsky. | |
Feb 22, 2017 at 15:57 | history | asked | Paul Wollan | CC BY-SA 3.0 |