Campus Units

Mathematics

Document Type

Article

Publication Version

Submitted Manuscript

Publication Date

11-9-2018

Journal or Book Title

arxiv

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.

Comments

This is a manuscript made available from arxiv: https://arxiv.org/abs/1811.03747.

Copyright Owner

The Authors

Language

en

File Format

application/pdf

Share

COinS