Ilkyoo Choi, Bernard Lidický, Florian Pfender
Published 2018-11-09Version 1
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.
Comments: 17 pages, 4 figures
On the inducibility of oriented graphs on four vertices
The Inducibility of Graphs on Four Vertices
Extremal Graph Theory for Metric Dimension and Girth
![QR code for arXiv:1811.03747 [math.CO]](http://oss.arxitics.com/images/favicon.svg)