Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 11 min ago
PreprintarXiv licencearXiv

Typical properties of countable graphs: flows and bridges

  • Robert Šámal
  • Hadi Zamani
Open at sourcePDFDOICite

Abstract

This paper has two aims. First, we study nowhere-zero flows in countably infinite graphs, observing the different roles played by two types of bridge. Second, we ask how typical graphs with such bridges are. Since there is no canonical probability measure on countable graphs, we explore an analytic approach and study which graph classes are nowhere dense and which are meager for two different definitions of a distance. We characterize in this sense graphs with a bridge (separating a finite component, or two infinite ones), D-edge-colorable graphs, etc.

Related

  1. Countable Graphs with Finite Path-width: Characterisation and Universality
    Tony Huynh, Freddie Illingworth, Nikolai Karol +4
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Very sharp distance and range transitions for random walk bridges on Ramanujan graphs
    Itai Benjamini
    arXivPreprintCC0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  3. Typical dynamical properties of operators on ℓp
    Jian Li, Qijing Liao
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. Lyapunov graphs of Non-singular Morse-Smale flows on S1 × S2
    Fangfang Chen
    arXivPreprintarXiv licenceFull textDynamical systemsarXiv
  5. On nowhere-zero 3-flows in Cayley graphs on groups of order p2n
    Milad Ahanjideh, István Kovács
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{samal2026typical,
  title = {{Typical properties of countable graphs: flows and bridges}},
  author = {Robert Šámal and Hadi Zamani},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.28016},
  eprint = {2609.28016},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.28016},
}
RIS
TY  - UNPB
TI  - Typical properties of countable graphs: flows and bridges
AU  - Robert Šámal
AU  - Hadi Zamani
PY  - 2026
DA  - 2026/09/23
PB  - arXiv
DO  - 10.48550/arxiv.2609.28016
UR  - https://arxiv.org/abs/2609.28016
AB  - This paper has two aims. First, we study nowhere-zero flows in countably infinite graphs, observing the different roles played by two types of bridge. Second, we ask how typical graphs with such bridges are. Since there is no canonical probability measure on countable graphs, we explore an analytic approach and study which graph classes are nowhere dense and which are meager for two different definitions of a distance. We characterize in this sense graphs with a bridge (separating a finite component, or two infinite ones), D-edge-colorable graphs, etc.
ER  -