Inducibility of directed paths
From MaRDI portal
Publication:785814
DOI10.1016/j.disc.2020.112015zbMath1445.05054arXiv1811.03747OpenAlexW2900367603MaRDI QIDQ785814
Florian Pfender, Ilkyoo Choi, Bernard Lidický
Publication date: 12 August 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.03747
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)
Related Items
Paths of length three are \(K_{r+1}\)-Turán-good ⋮ On the inducibility of oriented graphs on four vertices ⋮ C5 ${C}_{5}$ is almost a fractalizer ⋮ Stability from graph symmetrisation arguments with applications to inducibility ⋮ Maximum density of vertex-induced perfect cycles and paths in the hypercube ⋮ Maximizing five-cycles in \(K_r\)-free graphs
Uses Software
Cites Work
- A problem of Erdős and Sós on 3-graphs
- A new lower bound based on Gromov's method of selecting heavily covered points
- Monochromatic triangles in three-coloured graphs
- A note on the inducibility of 4-vertex graphs
- On the maximum number of five-cycles in a triangle-free graph
- A problem of Erdős on the minimum number of \(k\)-cliques
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
- The inducibility of graphs
- A bound on the inducibility of cycles
- Pentagons in triangle-free graphs
- On the number of pentagons in triangle-free graphs
- Quasirandom permutations are characterized by 4-point densities
- Rainbow triangles in three-colored graphs
- On the exact maximum induced density of almost all graphs and their inducibility
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- The Codegree Threshold for 3-Graphs with Independent Neighborhoods
- On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs
- Hypergraphs Do Jump
- A Solution to the 2/3 Conjecture
- A New Bound for the 2/3 Conjecture
- On the Density of Transitive Tournaments
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Limits of Order Types
- Flag algebras
- Counting flags in triangle-free digraphs
- On the inducibility of cycles
