Flows, view obstructions, and the lonely runner

DOI10.1006/jctb.1997.1770zbMath0910.05064OpenAlexW1980792135MaRDI QIDQ1386416

Pavol Gvozdjak, András Sebő, Wojciech Bienia, Michael Tarsi, Luis A. Goddyn

Publication date: 19 April 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e92db52a784dec2b154cbcefef5c12826df4fe15

zbMATH Keywords

flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Graph theory (05C99)

Related Items (22)

Correlation among runners and some results on the lonely runner conjecture ⋮ View-obstruction: a shorter proof for 6 lonely runners ⋮ Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem ⋮ On the time for a runner to get lonely ⋮ Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ ⋮ Coprime mappings and lonely runners ⋮ Regular chromatic number and the lonely runner problem ⋮ On the density of integral sets with missing differences from sets related to arithmetic progressions ⋮ Solving lonely runner conjecture through differential geometry ⋮ Random runners are very lonely ⋮ The lonely runner problem for lacunary sequences ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ LONELY RUNNERS IN FUNCTION FIELDS ⋮ Some remarks on the lonely runner conjecture ⋮ On optimal \(M\)-sets related to Motzkin's problem ⋮ Invisible runners in finite fields ⋮ Lonely Runner Polyhedra ⋮ Sequences of integers with three missing separations ⋮ Unnamed Item ⋮ The view-obstruction problem for \(n\)-dimensional cubes ⋮ On the chromatic number of circulant graphs ⋮ Antisymmetric flows and strong colourings of oriented graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• View-obstruction problems. III
• Nowhere zero flow and circuit covering in regular matroids
• Flows and generalized coloring theorems in graphs
• Decomposition of regular matroids
• Nowhere-zero 6-flows
• View-obstruction problems in \(n\)-dimensional geometry
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
• Zur simultanen homogenen diophantischen Approximation. I, II, III
• Untere Schranken für zwei diophantische Approximations-Funktionen
• View-obstruction problems
• Network Flow and Systems of Representatives
• View-Obstruction Problems. II
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Flows, view obstructions, and the lonely runner