Inducibility of directed paths
Combinatorics
2020-06-12 v2
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.
Keywords
Cite
@article{arxiv.1811.03747,
title = {Inducibility of directed paths},
author = {Ilkyoo Choi and Bernard Lidický and Florian Pfender},
journal= {arXiv preprint arXiv:1811.03747},
year = {2020}
}
Comments
17 pages, 4 figures