The anti-Ramsey problem was introduced by Erdös, Simonovits, and Sós in 1970s. The anti-Ramsey number of a hypergraph H, ar(n,s, H), is the smallest integer c such that in any coloring of the edges...
1 July 2018 in Journal of Combinatorial Theory, Series B
For integers $a\ge 2b>0$, a circular $a/b$-flow is a flow that takes values from $\{\pm b, \pm(b+1), \dots, \pm(a-b)\}$. The Planar Circular Flow Conjecture states that every $2k$-edge-connected pl...
1 January 2017 in SIAM Journal on Discrete Mathematics
Let $\mathbb Z_m$ be the cyclic group of order $m \geq 3$. A graph $G$ is $\mathbb Z_m$-connected if $G$ has an orientation $D$ such that for any mapping $b: V(G) \mapsto \mathbb Z_m$ with $\sum_{v...