The existence of \p,q\-orientations in edge-connected graphs
Abstract
In 1976 Frank and Gy\'arf\'as gave a necessary and sufficient condition for the existence of an orientation in an arbitrary graph G such that for each vertex v, the out-degree d+G(v) of it satisfies p(v) d+G(v) q(v), where p and q are two integer-valued functions on V(G) with p q. In this paper, we give a sufficient edge-connectivity condition for the existence of an orientation in G such that for each vertex v, d+G(v)∈ \p(v),q(v)\, provided that for each vertex v, p(v) 12dG(v) q(v), |q(v)-p(v)| k, and there is t(v)∈ \p(v),q(v)\ in which |E(G)|=Σv∈ V(G)t(v). This result is a generalization of a theorem due to Thomassen (2012) on the existence of modulo orientations in highly edge-connected graphs.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.