Flows, View Obstructions, and the Lonely Runner

Wojciech Bienia, Luis Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi

Type: Article

Publication Date: 1998-01-01

Citations: 61

DOI: https://doi.org/10.1006/jctb.1997.1770

Similar Works

Action	Title	Year	Authors
+	The lonely runner with seven runners	2007	Javier Barajas Oriol Serra
+ PDF Chat	LONELY RUNNERS IN FUNCTION FIELDS	2019	Sam Chow Luka Rimanić
+ PDF Chat	Some remarks on the lonely runner conjecture	2018	Terence Tao
+	Some remarks on the lonely runner conjecture	2018	Terence Tao
+	Lonely Runner Polyhedra	2016	Matthias Beck Serkan Hoşten Matthias Schymura
+	Some remarks on the lonely runner conjecture	2017	Terence Tao
+ PDF Chat	View-obstruction: a shorter proof for 6 lonely runners	2004	Jérôme Renault
+	The Proof of the Lonely Runner Conjecture	2017	Kurmet Sultan
+	Lonely Runner Polyhedra.	2019	Matthias Beck Serkan Hoşten Matthias Schymura
+	On the time for a runner to get lonely	2021	Ludovic Rifford
+	Barely lonely runners and very lonely runners	2019	Noah Kravitz
+	Circular flow number of Goldberg snarks	2021	Robert Lukoťka
+	Every Runner is Sometimes Lonely	2016	Matthias Beck
+	The cycle theorem for flows	1984	A. Sklar
+	Speed and Measure Theorems Related to the Lonely Runner Conjecture	2019	David Rudisill
+	A proof of the lonely runner conjecture	2012	Oleksiy Kurganskyy
+	Nowhere-zero 6-flows	1981	Paul Seymour
+	On the time for a runner to get lonely	2021	Ludovic Rifford
+	A new proof of Seymour's 6-flow theorem	2016	Matt DeVos Edita Rollová Robert Šámal
+	Nowhere-zero -flows on wheels	2007	Martin Kochol Nad’a Krivoňáková Silvia Smejová Katarína Šranková

Action	Title	Year	Authors
+ PDF Chat	LONELY RUNNERS IN FUNCTION FIELDS	2019	Sam Chow Luka Rimanić
+	Some remarks on the lonely runner conjecture	2017	Terence Tao
+	Barely lonely runners and very lonely runners	2019	Noah Kravitz
+ PDF Chat	On Optimal M-Sets Related to Motzkin’s Problem	2020	Quan-Hui Yang T. K. Pan Jian-Dong Wu
+	A Note on Lacunary Lonely Runners	2010	Stefan Steinerberger
+ PDF Chat	FROM RAINBOW TO THE LONELY RUNNER: A SURVEY ON COLORING PARAMETERS OF DISTANCE GRAPHS	2008	Daphne Der‐Fen Liu
+	On the density of integral sets with missing differences from sets related to arithmetic progressions	2011	Ram Krishna Pandey Amitabha Tripathi
+	Random runners are very lonely	2012	Sebastian Czerwiński
+	Random combinatorial structures with low dependencies : existence and enumeration	2013	Guillem Perarnau
+	Sequences of integers with three missing separations	2019	Daphne Der‐Fen Liu Grant Robinson

Action	Title	Year	Authors
+	View-obstruction problems. II	1982	Thomas W. Cusick
+	Nowhere zero flow and circuit covering in regular matroids	1985	Michael Tarsi
+	Flows and generalized coloring theorems in graphs	1979	F. M. Jaeger
+	Untere Schranken f�r zwei diophantische Approximations-Funktionen	1972	U. Betke J. M. Wills
+	View-obstruction problems in n-dimensional geometry	1974	Thomas W. Cusick
+	Nowhere-zero 6-flows	1981	Paul Seymour
+	Zur simultanen homogenen diophantischen Approximation III	1970	J�rg M. Wills
+	Zwei S�tze �ber inhomogene diophantische Approximation von Irrationalzehlen	1967	J�rg M. Wills
+ PDF Chat	A Contribution to the Theory of Chromatic Polynomials	1954	W. T. Tutte
+	Some recent applications of the theory of linear inequalities to extremal combinatorial analysis	1960	Alan J. Hoffman