Name
Abstract | ||
|---|---|---|
A conjecture of Gallai states that if a graphG onn vertices contains no subgraph isomorphic to a wheel then the number of triangles inG is at mostn2/8. In this note it is shown that this number is at most (1 +o(1))n2/7, and in addition we exhibit a large family of graphs that shows that if the conjecture is true then there are many extremal examples. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/BF01787421 | Graphs and Combinatorics |
Keywords | Field | DocType |
Large Family, Subgraph Isomorphic | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Lonely runner conjecture,Isomorphism,Beal's conjecture,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
11 | 1 | 1435-5914 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. E. Haxell | 1 | 212 | 26.40 |