Non-Three-Colourable Common Graphs Exist
From MaRDI portal
Publication:2911071
DOI10.1017/S0963548312000107zbMath1248.05090arXiv1105.0307WikidataQ57601388 ScholiaQ57601388MaRDI QIDQ2911071
Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov
Publication date: 12 September 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.0307
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
05C15: Coloring of graphs and hypergraphs
05C55: Generalized Ramsey theory
Related Items
Weak regularity and finitely forcible graph limits, A New Bound for the 2/3 Conjecture, Threshold Ramsey multiplicity for odd cycles, Finitely forcible graphons with an almost arbitrary structure, Decomposing Graphs into Edges and Triangles, On the Density of Transitive Tournaments, Minimum Number of Monotone Subsequences of Length 4 in Permutations, Counting flags in triangle-free digraphs, On tripartite common graphs, Locally common graphs, 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, On the algebraic and topological structure of the set of Turán densities, A new lower bound based on Gromov's method of selecting heavily covered points, Monochromatic triangles in three-coloured graphs, Finitely forcible graphons and permutons, Finitely forcible graph limits are universal, The step Sidorenko property and non-norming edge-transitive graphs, Extremal problems and results related to Gallai-colorings, Threshold Ramsey multiplicity for paths and even cycles, Non-bipartite \(k\)-common graphs, Minimum number of edges that occur in odd cycles, Compactness and finite forcibility of graphons, Graph theory. Abstracts from the workshop held January 2--8, 2022, On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs, More about sparse halves in triangle-free graphs
Cites Work
- Unnamed Item
- An approximate version of Sidorenko's conjecture
- Graphs containing triangles are not 3-common
- Multiplicities of subgraphs
- A correlation inequality for bipartite graphs
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- Hypergraphs Do Jump
- On Sets of Acquaintances and Strangers at any Party
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- On the Ramsey multiplicities of graphs—problems and recent results
- Flag algebras
- Quasi-random graphs
- Graph norms and Sidorenko's conjecture
