A note on the inducibility of 4-vertex graphs
From MaRDI portal
(Redirected from Publication:497330)
Abstract: There is much recent interest in understanding the density at which constant size graphs can appear in a very large graph. Specifically, the inducibility of a graph H is its extremal density, as an induced subgraph of G, where |G| -> infinity. Already for 4-vertex graphs many questions are still open. Thus, the inducibility of the 4-path was addressed in a construction of Exoo (1986), but remains unknown. Refuting a conjecture of Erdos, Thomason (1997) constructed graphs with a small density of both 4-cliques and 4-anticliques. In this note, we merge these two approaches and construct better graphs for both problems.
Recommendations
Cites work
- scientific article; zbMATH DE number 3989382 (Why is no real title available?)
- scientific article; zbMATH DE number 4061279 (Why is no real title available?)
- scientific article; zbMATH DE number 3722700 (Why is no real title available?)
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Flag algebras
- Graph products and monochromatic multiplicities
- Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal
- Large networks and graph limits
- Multiplicities of subgraphs
- Nowhere-zero 3-flows in triangularly connected graphs
- On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
- On Sets of Acquaintances and Strangers at any Party
- On a conjecture of Erdős for multiplicities of cliques
- On the 3-local profiles of graphs
- On the Ramsey multiplicity of complete graphs
- On the densities of cliques and independent sets in graphs
- On the local profiles of trees
- On the number of 4-cycles in a tournament
- On the number of complete subgraphs contained in certain graphs
- On the page number of complete odd-partite graphs
- Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
- The inducibility of blow-up graphs
- The inducibility of complete bipartite graphs
- The inducibility of graphs
- The inducibility of graphs on four vertices
- The maximal number of induced \(r\)-partite subgraphs
- The maximal number of induced complete bipartite graphs
- The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
- The patterns of permutations
Cited in
(23)- On the exact maximum induced density of almost all graphs and their inducibility
- The inducibility of graphs on four vertices
- On the inducibility of oriented graphs on four vertices
- Sharp bounds for decomposing graphs into edges and triangles
- Maximising the number of induced cycles in a graph
- Inducibility and universality for trees
- Inducibility in binary trees and crossings in random tanglegrams
- Inducibility of directed paths
- On the inducibility of cycles
- Inducibility of \(d\)-ary trees
- Maximum density of vertex-induced perfect cycles and paths in the hypercube
- The maximum number of induced C5's in a planar graph
- Decomposing graphs into edges and triangles
- scientific article; zbMATH DE number 6692115 (Why is no real title available?)
- Planar graphs with the maximum number of induced 6-cycles
- Inducibility in the hypercube
- The feasible region of induced graphs
- Further results on the inducibility of \(d\)-ary trees
- Stability from graph symmetrisation arguments with applications to inducibility
- Compactness and finite forcibility of graphons
- C5 ${C}_{5}$ is almost a fractalizer
- On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices
- On tripartite common graphs
This page was built for publication: A note on the inducibility of 4-vertex graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497330)
