A note on the inducibility of 4-vertex graphs

DOI10.1007/s00373-014-1475-4zbMath1321.05143arXiv1312.1205OpenAlexW2120140145MaRDI QIDQ497330

Nathan Linial, Chaim Even-Zohar

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.1205

zbMATH Keywords

graph densityinducibilityRamsey multiplicity

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Density (toughness, etc.) (05C42)

Related Items

On tripartite common graphs ⋮ Inducibility and universality for trees ⋮ On the inducibility of oriented graphs on four vertices ⋮ Maximising the number of induced cycles in a graph ⋮ Inducibility in Binary Trees and Crossings in Random Tanglegrams ⋮ C5 ${C}_{5}$ is almost a fractalizer ⋮ The maximum number of induced C5's in a planar graph ⋮ On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices ⋮ On the exact maximum induced density of almost all graphs and their inducibility ⋮ Stability from graph symmetrisation arguments with applications to inducibility ⋮ Further results on the inducibility of $d$-ary trees ⋮ Planar graphs with the maximum number of induced 6-cycles ⋮ Inducibility in the hypercube ⋮ Maximum density of vertex-induced perfect cycles and paths in the hypercube ⋮ On the inducibility of cycles ⋮ Inducibility of \(d\)-ary trees ⋮ Decomposing Graphs into Edges and Triangles ⋮ Compactness and finite forcibility of graphons ⋮ Inducibility of directed paths ⋮ The feasible region of induced graphs

Uses Software

• Flagmatic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the page number of complete odd-partite graphs
• On the Ramsey multiplicity of complete graphs
• The inducibility of blow-up graphs
• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• Nowhere-zero 3-flows in triangularly connected graphs
• The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
• The maximal number of induced complete bipartite graphs
• Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
• On the number of complete subgraphs contained in certain graphs
• The inducibility of graphs
• Graph products and monochromatic multiplicities
• The maximal number of induced \(r\)-partite subgraphs
• The patterns of permutations
• On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
• Multiplicities of subgraphs
• On a conjecture of Erdős for multiplicities of cliques
• On the Number of 4-Cycles in a Tournament
• On Sets of Acquaintances and Strangers at any Party
• On the Local Profiles of Trees
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• The inducibility of complete bipartite graphs
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal
• The Inducibility of Graphs on Four Vertices
• Flag algebras
• On the 3‐Local Profiles of Graphs
• On the densities of cliques and independent sets in graphs