Timeline for Proving a theorem on coloring a peculiar graph
Current License: CC BY-SA 4.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 25, 2019 at 20:50 | comment | added | EGME | After doing that, you would try to prove a hypergraph analogue of Vizing’s theorem. If you do that, you solve the problem. It is conjectured. | |
Jun 25, 2019 at 18:22 | comment | added | EGME | Interesting, this is the second time you ask the question about this problem (that I know of), although this time you tried to solve it in a different way. Here is something you could try if you are interested in solving this problem. Try extending the concept of a Kierstead path to simple hypergraphs. This requires careful thought, and it might not even be possible in any really useful way. | |
Jun 25, 2019 at 16:05 | vote | accept | vidyarthi | ||
Jun 25, 2019 at 16:02 | vote | accept | vidyarthi | ||
Jun 25, 2019 at 16:05 | |||||
Jun 25, 2019 at 15:42 | vote | accept | vidyarthi | ||
Jun 25, 2019 at 15:45 | |||||
Jun 25, 2019 at 15:25 | answer | added | Gabe Conant | timeline score: 3 | |
Jun 25, 2019 at 10:02 | comment | added | vidyarthi | @Bullet51 yes, so where is my argument wrong? | |
Jun 25, 2019 at 10:01 | comment | added | LeechLattice | The problem you are asking is exactly the Erdos-Fabeb-Lovasz Conjecture. | |
Jun 25, 2019 at 9:49 | history | asked | vidyarthi | CC BY-SA 4.0 |