Skip to main content
12 events
when toggle format what by license comment
Sep 27, 2019 at 17:33 history closed LSpice
Ben Barber
LeechLattice
Leo Alonso
Neil Hoffman
Not suitable for this site
Sep 17, 2019 at 4:52 vote accept vidyarthi
Sep 17, 2019 at 4:51 comment added vidyarthi @LSpice Actually, I did not propose any proof, rather a heuristic, which, later was seen so to be false, by myself, as posted in an answer. Well, many questions in this site are actually of this form. Maybe, in this case, the problem was more celebrated.
Sep 16, 2019 at 21:21 comment added LSpice I'm voting to close this question as off-topic because MO is not a site for checking proposed proofs.
Sep 13, 2019 at 15:20 review Close votes
Sep 27, 2019 at 17:33
Sep 13, 2019 at 5:04 answer added vidyarthi timeline score: 1
Sep 6, 2019 at 6:29 comment added vidyarthi @Bullet51 actually I am coloring the edges of the bipartite graphs. So, when I give a list of length $\chi'(G)$, I think I would have enough scope to avoid the intersection of two incident edges having same color; because the maximum degree of the bipartite graphs is always less than or equal to that of the whole graph and $\chi'(G)\ge\Delta(G)$. I think by colors shared by a vertex, you meant intersection of two incident edges having same color?
Sep 5, 2019 at 23:13 comment added LeechLattice This may not be a list coloring, as there may be repeated colors shared by a vertex while coloring $A \cup B$ and $B \cup C$. Further arguments are required to ensure that there are no repeated colors.
Sep 5, 2019 at 16:41 history edited vidyarthi CC BY-SA 4.0
deleted 80 characters in body
Sep 5, 2019 at 16:29 history edited vidyarthi CC BY-SA 4.0
added 83 characters in body
Sep 5, 2019 at 16:03 history edited YCor CC BY-SA 4.0
removed capitals from title
Sep 5, 2019 at 15:28 history asked vidyarthi CC BY-SA 4.0