On tripartite common graphs

DOI10.1017/S0963548322000074MaRDI QIDQ5886347zbMATH OpenOpenAlexFDO

Authors A. Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec

Publication date 31 March 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

common graphsSidorenko's conjecturetriangle-tree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Recommendations

• Non-three-colourable common graphs exist
• Graphs containing triangles are not 3-common
• Anti-Ramsey Multiplicities
• Toward characterizing locally common graphs
• Common graphs with arbitrary connectivity and chromatic number

Cites work

• A Disproof of a Conjecture of Erdős in Ramsey Theory
• A note on the inducibility of 4-vertex graphs
• An approximate version of Sidorenko's conjecture
• Bipartite subgraphs and quasi-randomness
• CSDP, A C library for semidefinite programming
• Cycles in graphs and functional inequalities
• Finite reflection groups and graph norms
• Flag algebras
• Graph minors. III. Planar tree-width
• Graph products and monochromatic multiplicities
• scientific article; zbMATH DE number 903461 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• Inequalities for functionals generated by bipartite graphs
• Large networks and graph limits
• Multiplicities of subgraphs
• Non-bipartite \(k\)-common graphs
• Non-three-colourable common graphs exist
• On Sets of Acquaintances and Strangers at any Party
• On the number of complete subgraphs contained in certain graphs
• On the Ramsey multiplicities of graphs—problems and recent results
• Ramsey multiplicity of linear patterns in certain finite abelian groups
• S-functions for graphs
• Sidorenko's conjecture for blow-ups
• Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
• The minimum number of monochromatic 4-term progressions in Z_p
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• There exist graphs with super‐exponential Ramsey multiplicity constant

Cited in

(16)

• Non-bipartite \(k\)-common graphs
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• Non-three-colourable common graphs exist
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• Toward characterizing locally common graphs
• A Property on Monochromatic Copies of Graphs Containing a Triangle
• Common graphs with arbitrary connectivity and chromatic number
• Extended commonality of paths and cycles via Schur convexity
• Graphs containing triangles are not 3-common
• Off-diagonal commonality of graphs via entropy
• When entropy meets Turán: new proofs and hypergraph Turán results
• Common pairs of graphs
• Common graphs with arbitrary chromatic number
• Turán colourings in off-diagonal Ramsey multiplicity
• Disconnected common graphs via supersaturation
• Ramsey multiplicity of apices of trees

Describes a project that uses

Uses Software

• Flagmatic

This page was built for publication: On tripartite common graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886347)