On the balanceability of some graph classes

17 Nov 2020 Dailly Antoine Hansberg Adriana Ventura Denae

Given a graph $G$, a 2-coloring of the edges of $K_n$ is said to contain a balanced copy of $G$ if we can find a copy of $G$ such that half of its edges are in each color class. If, for every sufficiently large $n$, there exists an integer $k$ such that every 2-coloring of $K_n$ with more than $k$ edges in each color class contains a balanced copy of $G$, then we say that $G$ is balanceable... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS
  • DISCRETE MATHEMATICS