Extremal size of graphs without a nowhere-zero 3-flow
A nowhere-zero \(k\)-flow on a directed graph \(G\) with edge-set \(E\) is a function \(f: E\to\mathbb{Z}\) with \(0<|f(e)|< k\) for each edge \(e\) and fulfilling the flow condition at each vertext. For \(k= 3\) (for \(k=4\) compare \textit{H.-J. Lai} [J. Graph Theory 19, No. 3, 385-395 (1995; Zbl 0822.05064)]) it is shown that if \(G\) is a 2-edge-connected simple graph with \(n\geq 6\) vertices and at least \(\left(\begin{smallmatrix} n-5\\ 2\end{smallmatrix}\right)+ 46\) edges then either \(G\) has a nowhere-zero 3-flow, or \(G\) can be contracted to a \(K_4\).
- The size of graphs with clique number \(m\) and without nowhere-zero 4-flows
- Contractible configurations on 3-flows in graphs satisfying the Fan-condition
- Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts
- Minimum degree and nowhere-zero 3-flows
- Ore Condition and Nowhere-Zero 3-Flows
- Extending a partial nowhere-zero 4-flow
- The size of graphs without nowhere‐zero 4‐flows
- Nowhere‐zero 3‐flows in locally connected graphs
- Degree sum and nowhere-zero 3-flows
This page was built for publication: Extremal size of graphs without a nowhere-zero 3-flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2732635)
