Timeline for Clique cover number of a generalized Kneser graph $K(n,4,2)$
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 23, 2020 at 4:48 | comment | added | Alex Ravsky | @vidyarthi I'm not aware on a suitable version. | |
| Jul 22, 2020 at 20:16 | comment | added | vidyarthi | Cant we use a version of Baranyai's theorem here? | |
| Jul 22, 2020 at 20:09 | comment | added | Alex Ravsky | @vidyarthi The main question is about tighter bounds for $m(n)$. | |
| Jul 22, 2020 at 19:48 | comment | added | vidyarthi | so, finally, what is the main question? You meant the title is itself your question? | |
| Jun 17, 2020 at 2:55 | history | edited | Alex Ravsky |
edited tags
|
|
| Jun 16, 2020 at 5:17 | history | asked | Alex Ravsky | CC BY-SA 4.0 |