Nowhere-zero flows in random graphs

DOI10.1006/jctb.2000.2007zbMath1027.05086OpenAlexW2037091242MaRDI QIDQ1850523

Benjamin Sudakov

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/189fb7317bf3b175b216abfaccd764c5f65c6cf7

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (5)

\(Z_3\)-connectivity in abelian Cayley graphs ⋮ Group connectivity in line graphs ⋮ Modular Orientations of Random and Quasi-Random Regular Graphs ⋮ Nowhere-zero 3-flows in Cayley graphs and Sylow 2-subgroups ⋮ Coloring drawings of graphs

Cites Work

• Threshold functions
• The isoperimetric number of random regular graphs
• Flows and generalized coloring theorems in graphs
• A generalization of max flow—min cut
• Almost all regular graphs are hamiltonian
• On the algebraic theory of graph colorings
• A Contribution to the Theory of Chromatic Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nowhere-zero flows in random graphs