On the inducibility of oriented graphs on four vertices
From MaRDI portal
Publication:2138968
DOI10.1016/j.disc.2022.112874zbMath1489.05075arXiv2010.11664OpenAlexW3094191566MaRDI QIDQ2138968
Andrzej Grzesik, Bartłomiej Kielak, Łukasz Bożyk
Publication date: 17 May 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.11664
Extremal problems in graph theory (05C35) Semidefinite programming (90C22) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
C5 ${C}_{5}$ is almost a fractalizer ⋮ Stability from graph symmetrisation arguments with applications to inducibility
Uses Software
Cites Work
- The inducibility of blow-up graphs
- A note on the inducibility of 4-vertex graphs
- Inducibility of directed paths
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
- The maximal number of induced complete bipartite graphs
- The inducibility of graphs
- A bound on the inducibility of cycles
- The maximal number of induced \(r\)-partite subgraphs
- On the exact maximum induced density of almost all graphs and their inducibility
- The inducibility of complete bipartite graphs
- CSDP, A C library for semidefinite programming
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- On the Maximum Induced Density of Directed Stars and Related Problems
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- The Inducibility of Graphs on Four Vertices
- Flag algebras
- On the inducibility of cycles
This page was built for publication: On the inducibility of oriented graphs on four vertices