Flows, View Obstructions, and the Lonely Runner

1998/01/01 by Wojciech Bienia, Luis Goddyn, Pavol Gvozdjak +3 · 29 citations
Mathematics · #Collatz conjecture #Combinatorics #Computer science #Conjecture #Constant (computer programming) #Discrete mathematics #Exponential function #Flow (mathematics) #Fork (system call) #Geometry #Graph #Lonely runner conjecture #Mathematical analysis #Mathematics #Mathematics and Applications #Unit cube

paper · doi:10.1006/jctb.1997.1770

published in Journal of Combinatorial Theory, Series B 72(1), 1-9 (Elsevier BV)

crossref issued 1998/01/01 · crossref published 1998/01/01 · crossref published-print 1998/01/01 · openalex publication_date 1998/01/01 · crossref created 2002/10/07 · crossref deposited 2019/05/07 · openalex created_date 2025/10/10 · crossref indexed 2026/07/15 · openalex updated_date 2026/07/23

Citations

• View-obstruction problems, III
• View-obstruction problems
• Decomposition of regular matroids
• Untere Schranken f�r zwei diophantische Approximations-Funktionen
• Zwei S�tze �ber inhomogene diophantische Approximation von Irrationalzehlen
• A Contribution to the Theory of Chromatic Polynomials

Cited by

• The View-Obstruction Problem forn-Dimensional Cubes
• On the chromatic number of circulant graphs
• Random runners are very lonely
• Invisible runners in finite fields
• View-obstruction: a shorter proof for 6 lonely runners
• The lonely runner problem for lacunary sequences
• The Lonely Runner with Seven Runners
• Six Lonely Runners
• The lonely runner problem for many runners
• Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem
• Correlation Among Runners and Some Results on the Lonely Runner Conjecture
• Lonely runner conjecture [wikipedia]