Name
Abstract | ||
|---|---|---|
Let S\"n denote the graph on {1,...,n} in which two numbers are adjacent if and only if they are coprime. Around 1980 Entringer conjectured that S\"n contains every tree of order n as a subgraph. Here we show that this conjecture is true for all n= |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.disc.2005.11.083 | Discrete Mathematics |
Keywords | Field | DocType |
prime graphs,trees,entringer's conjecture | Discrete mathematics,Graph,Combinatorics,If and only if,Conjecture,Coprime integers,Mathematics,Almost prime | Journal |
Volume | Issue | ISSN |
307 | 11-12 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oleg Pikhurko | 1 | 318 | 47.03 |