Skip to main content
Emil's user avatar
Emil's user avatar
Emil's user avatar
Emil
  • Member for 15 years, 1 month
  • London
comment
Undecidable graph problems?
@gowers: by "undecidability", do you mean that the answer may depend on which system of set theory is in force?
comment
Why is edge-coloring less interesting than vertex-coloring?
@Boris: this is the sort of answer I am looking for. Could you elaborate?
awarded
comment
Why is edge-coloring less interesting than vertex-coloring?
There are many applications of edge-coloring.
comment
Why is edge-coloring less interesting than vertex-coloring?
Yes but generally we can't transition between vertex- and edge- coloring - Tait's theorem is quite unusual in this regard. Are there other examples of where we can do this?
comment
Why is edge-coloring less interesting than vertex-coloring?
Yes, but why study fields when we can study rings? Or why study groups when we could study monoids?
Loading…
awarded
accepted
comment
Regularizing graphs
I meant a constant that does not depend on $n$ (the number of vertices) or $\Delta(G)$. I've rephrased it now - people can interpret the question as they wish.
revised
Regularizing graphs
rephrased last sentence
Loading…
awarded
asked
Loading…
awarded
revised
Loading…
Loading…
comment
Hamilton cycle decompositions of the complete graph
Jason - that table counts cycles, not decompositions.
comment
Cures for mathematician's block (as in writer's block)
@Ben: this doesn't mean that the authors did not work alone - it just means they pooled their results.
comment
Combinatorial results without known combinatorial proofs
But surely "counting arguments" is combinatorial. Do you mean you want a bijective proof?
awarded