Inducibility of directed paths
Date
2018-11-09
Authors
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Series Number
Journal Issue
Is Version Of
Article
Inducibility of directed paths
(Elsevier,
2020-10)
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.
Versions
Series
Academic or Administrative Unit
Type
article
Comments
This is a preprint made available from arxiv: https://arxiv.org/abs/1811.03747.
Rights Statement
Copyright
Mon Jan 01 00:00:00 UTC 2018