Combinatorica
Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Additive bases of vector spaces over prime fields
Journal of Combinatorial Theory Series A
On the second eigenvalue of a graph
Discrete Mathematics
Nowhere-zero 3-flows of highly connected graphs
Discrete Mathematics
Handbook of combinatorics (vol. 1)
Nowhere-zero flows in random graphs
Journal of Combinatorial Theory Series B
MaxCut in ${\bm H)$-Free Graphs
Combinatorics, Probability and Computing
On mod (2p +1)-orientations of graphs
Journal of Combinatorial Theory Series B
Nowhere-zero 3-flows and modulo k-orientations
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
Extending an old conjecture of Tutte, Jaeger conjectured in 1988 that for any fixed integer p ≥ 1, the edges of any 4p-edge connected graph can be oriented so that the difference between the outdegree and the indegree of each vertex is divisible by 2p+1. It is known that it suffices to prove this conjecture for (4p+1)-regular, 4p-edge connected graphs. Here we show that there exists a finite p0 such that for every p p0 the assertion of the conjecture holds for all (4p+1)-regular graphs that satisfy some mild quasi-random properties, namely, the absolute value of each of their non-trivial eigenvalues is at most c1p2/3 and the neighbourhood of each vertex contains at most c2p3/2 edges, where c1, c2 0 are two absolute constants. In particular, this implies that for p p0 the assertion of the conjecture holds asymptotically almost surely for random (4p+1)-regular graphs.