Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6671695> ?p ?o }
Showing triples 1 to 18 of
18
with 100 triples per page.
- Q6671695 subject Q6248542.
- Q6671695 subject Q7217289.
- Q6671695 subject Q7264611.
- Q6671695 abstract "In number theory, and especially the study of diophantine approximation, the lonely runner conjecture is a conjecture originally due to J. M. Wills in 1967. Applications of the conjecture are widespread in mathematics; they include view obstruction problems and calculating the chromatic number of distance graphs and circulant graphs. The conjecture was given its picturesque name by L. Goddyn in 1998.".
- Q6671695 thumbnail Lonely_runner.gif?width=300.
- Q6671695 wikiPageExternalLink lonely_runner_conjecture.
- Q6671695 wikiPageWikiLink Q1227061.
- Q6671695 wikiPageWikiLink Q12479.
- Q6671695 wikiPageWikiLink Q131752.
- Q6671695 wikiPageWikiLink Q319141.
- Q6671695 wikiPageWikiLink Q504843.
- Q6671695 wikiPageWikiLink Q5121633.
- Q6671695 wikiPageWikiLink Q6248542.
- Q6671695 wikiPageWikiLink Q7217289.
- Q6671695 wikiPageWikiLink Q7264611.
- Q6671695 comment "In number theory, and especially the study of diophantine approximation, the lonely runner conjecture is a conjecture originally due to J. M. Wills in 1967. Applications of the conjecture are widespread in mathematics; they include view obstruction problems and calculating the chromatic number of distance graphs and circulant graphs. The conjecture was given its picturesque name by L. Goddyn in 1998.".
- Q6671695 label "Lonely runner conjecture".
- Q6671695 depiction Lonely_runner.gif.