![](https://d3ilqtpdwi981i.cloudfront.net/OJ2AQV-T1NN0KrDZYvsBGqz0q9E=/425x550/smart/https://bepress-attached-resources.s3.amazonaws.com/uploads/bb/fb/8b/bbfb8be8-8dcf-4dde-b335-459c89ff64f2/thumbnail_82b08a4f-698b-4443-b42d-09af0c0b7f72.jpg)
Article
Inducibility of directed paths
arxiv
Document Type
Article
Disciplines
Publication Version
Submitted Manuscript
Publication Date
11-9-2018
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.
Copyright Owner
The Authors
Copyright Date
2018
Language
en
File Format
application/pdf
Citation Information
Ilkyoo Choi, Bernard Lidicky and Florian Pfender. "Inducibility of directed paths" arxiv (2018) Available at: http://works.bepress.com/bernard-lidicky/60/
This is a manuscript made available from arxiv: https://arxiv.org/abs/1811.03747.