Zero-sum flows of the linear lattice.
DOI10.1016/J.FFA.2014.09.001zbMATH Open1318.06002OpenAlexW1982139864MaRDI QIDQ473085FDOQ473085
Authors: Ghassan Sarkis, Shahriar Shahriari, PCURC 
Publication date: 21 November 2014
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2014.09.001
Recommendations
- Zero-sum flows in regular graphs
- Zero-sum flow numbers of triangular grids
- A generalization of 0-sum flows in graphs
- Lattice flows in networks
- Zero-sum flows for Steiner systems
- On recurrence in zero dimensional flows
- The lattice of integer flows of a regular matroid
- Zero-sum flow numbers of regular graphs
- Zero-sum flow numbers of hexagonal grids
- The Lattice Structure of Flow in Planar Graphs
nowhere-zero flowszero-sum flowslinear latticessubspace latticesnowhere-zero tradesnullspace of incidence matrices
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Flows in graphs (05C21) Combinatorics of partially ordered sets (06A07) Lattices of subspaces and geometric closure systems (51D25) Algebraic aspects of posets (06A11)
Cites Work
- A Contribution to the Theory of Chromatic Polynomials
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Title not available (Why is that?)
- On zero-sum 6-flows of graphs
- A note on zero-sum 5-flows in regular graphs
- Zero-sum flows in regular graphs
- Every Planar Map is Four Colorable
- Nowhere-zero 6-flows
- Nowhere-zero integral flows on a bidirected graph
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- Title not available (Why is that?)
- On parallelisms in finite projective spaces
- Diamond-free subsets in the linear lattices
- Zero-sum flows in designs
Cited In (7)
- Zero-sum flows in designs
- \(L_{\infty}\) norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs
- Zero-sum flows for triple systems
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
- The flow lattice of oriented matroids
- Circular zero-sum \(r\)-flows of regular graphs
- Nowhere–zero bases for the nullspace of the incidence matrices of graphs
This page was built for publication: Zero-sum flows of the linear lattice.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473085)
