Almost all 9-regular graphs have a modulo-5 orientation

DOI10.37236/12513MaRDI QIDQ6977170zbMATH OpenFDO

Authors Michelle Delcourt, Reaz Huq, Paweł Prałat

Publication date 30 May 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/12513

zbMATH Keywords

random graphs3-flowsmall subgraph conditioning method

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Flows in graphs (05C21)

Cites work

• scientific article; zbMATH DE number 3904637 (Why is no real title available?)
• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• scientific article; zbMATH DE number 863473 (Why is no real title available?)
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Additive bases of vector spaces over prime fields
• Almost all 5-regular graphs have a 3-flow
• Almost all regular graphs are hamiltonian
• Counterexamples to Jaeger's circular flow conjecture
• Decomposing random regular graphs into stars
• Graph theory with applications
• Modular orientations of random and quasi-random regular graphs
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere-zero 3-flows of highly connected graphs
• On the number of perfect matchings in random lifts
• Random 4-regular graphs have 3-star decompositions asymptotically almost surely
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Random graphs.
• The weak 3-flow conjecture and the weak circular flow conjecture

This page was built for publication: Almost all 9-regular graphs have a modulo-5 orientation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977170)