On the exact maximum induced density of almost all graphs and their inducibility
From MaRDI portal
Publication:2421550
DOI10.1016/j.jctb.2018.09.005zbMath1414.05173arXiv1801.01047OpenAlexW2964236950WikidataQ129091914 ScholiaQ129091914MaRDI QIDQ2421550
Publication date: 17 June 2019
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.01047
Related Items (10)
Inducibility and universality for trees ⋮ On the inducibility of oriented graphs on four vertices ⋮ C5 ${C}_{5}$ is almost a fractalizer ⋮ On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices ⋮ Stability from graph symmetrisation arguments with applications to inducibility ⋮ Planar graphs with the maximum number of induced 6-cycles ⋮ The edge-statistics conjecture for \(\ell \ll k^{6/5} \) ⋮ Anticoncentration for subgraph statistics ⋮ Edge-statistics on large graphs ⋮ Inducibility of directed paths
Uses Software
Cites Work
- Unnamed Item
- Turán \(H\)-densities for 3-graphs
- The inducibility of blow-up graphs
- On possible Turán densities
- A note on the inducibility of 4-vertex graphs
- 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
- The maximal number of induced \(r\)-partite subgraphs
- On Sets of Acquaintances and Strangers at any Party
- The inducibility of complete bipartite graphs
- On the asymmetry of random regular graphs and random graphs
- On the Maximum Induced Density of Directed Stars and Related Problems
- The Inducibility of Graphs on Four Vertices
- Flag algebras
- Asymmetric graphs
- On the inducibility of cycles
This page was built for publication: On the exact maximum induced density of almost all graphs and their inducibility
