Name
Abstract | ||
|---|---|---|
A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more tractable. Here we resolve this problem in the setting of oriented graphs without transitive triangles. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.disc.2020.112015 | Discrete Mathematics |
Keywords | DocType | Volume |
Induced subgraph,Inducibility,Directed path | Journal | 343 |
Issue | ISSN | Citations |
10 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ilkyoo Choi | 1 | 26 | 12.04 |
| Bernard Lidický | 2 | 9 | 5.00 |
| Florian Pfender | 3 | 285 | 30.96 |