Modular orientations of random and quasi-random regular graphs
From MaRDI portal
Recommendations
Cites work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Additive bases of vector spaces over prime fields
- Eigenvalues and expanders
- Expander graphs and their applications
- Explicit construction of linear sized tolerant networks
- MaxCut in ${\bm H)$-Free Graphs
- Nowhere-zero 3-flows of highly connected graphs
- Nowhere-zero flows in random graphs
- On mod \((2p+1)\)-orientations of graphs
- On the algebraic theory of graph colorings
- On the degrees of the vertices of a directed graph
- On the second eigenvalue of a graph
Cited in
(7)- Random 4-regular graphs have 3-star decompositions asymptotically almost surely
- On star decompositions of random regular graphs
- Mod \((2p+1)\)-orientation on bipartite graphs and complementary graphs
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Modulo k-orientations of random regular graphs
- Decomposing random regular graphs into stars
- Almost all 9-regular graphs have a modulo-5 orientation
This page was built for publication: Modular orientations of random and quasi-random regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2998847)
