Name
Abstract | ||
|---|---|---|
Seymour's distance two conjecture states that in any digraph there exists a vertex (a \"Seymour vertex\") that has at least as many neighbors at distance two as it does at distance one. We explore the validity of probabilistic statements along lines suggested by Seymour's conjecture, proving that almost surely there are a \"large\" number of Seymour vertices in random tournaments and \"even more\" in general random digraphs. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s00373-015-1672-9 | Graphs and Combinatorics |
Keywords | Field | DocType |
Tournament, Digraph, Seymour’s conjecture | Discrete mathematics,Tournament,Combinatorics,Existential quantification,Vertex (geometry),Almost surely,Probabilistic logic,Conjecture,Digraph,Mathematics | Journal |
Volume | Issue | ISSN |
32 | 5 | 1435-5914 |
Citations | PageRank | References |
2 | 0.49 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| zachary cohn | 1 | 2 | 0.49 |
| Anant P. Godbole | 2 | 95 | 16.08 |
| elizabeth wright harkness | 3 | 2 | 0.49 |
| yiguang zhang | 4 | 2 | 0.49 |