Skip to main content
Tjaden Hess's user avatar
Tjaden Hess's user avatar
Tjaden Hess's user avatar
Tjaden Hess
  • Member for 5 years, 4 months
  • Last seen more than a month ago
awarded
awarded
comment
Does every graph admit an embedding such that identically-colored edges do not cross?
Ah yes, thinking of it as the union of planar subgraphs does make the structure of the problem much clearer. Seems obvious now, but thank you for the tip
Loading…
awarded
awarded