Abstract

A mod (2p+1)-orientation D is an orientation of G such that dD+(v)≡dD−(v)(mod2p+1) for any vertex v∈V(G). Extending Tutte’s integer flow conjectures, it was conjectured by Jaeger that every 4p-edge-connected graph has a mod (2p+1)-orientation. However, this conjecture has been disproved in Han et al. (2018) recently. Infinite families of 4p-edge-connected graphs (for p≥3) and (4p+1)-edge-connected graphs (for p≥5) with no mod (2p+1)-orientation are constructed in Han et al. (2018). In this paper, we show that every family of graphs with bounded independence number has only finitely many contraction obstacles for admitting mod (2p+1)-orientations, contrasting to those infinite families. More precisely, we prove that for any integer t≥2, there exists a finite family F=F(p,t) of graphs that do not have a mod (2p+1)-orientation, such that every graph G with independence number at most t either admits a mod (2p+1)-orientation or is contractible to a member in F. This indicates that the problem of determining whether every k-edge-connected graph with independence number at most t admits a mod (2p+1)-orientation is computationally solvable for fixed k and t. In particular, the graph family F(p,2) is determined, and our results imply that every 8-edge-connected graph G with independence number at most two admits a mod 5-orientation.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.