A Solution to the 2/3 Conjecture
From MaRDI portal
Publication:3192162
DOI10.1137/130926614zbMath1298.05099arXiv1306.6202OpenAlexW2044216784WikidataQ123236178 ScholiaQ123236178MaRDI QIDQ3192162
Publication date: 26 September 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.6202
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (13)
Finitely forcible graph limits are universal ⋮ Rainbow triangles in three-colored graphs ⋮ C5 ${C}_{5}$ is almost a fractalizer ⋮ Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ Finitely forcible graphons with an almost arbitrary structure ⋮ Finitely forcible graphons and permutons ⋮ Decomposing Graphs into Edges and Triangles ⋮ Minimum number of edges that occur in odd cycles ⋮ Weak regularity and finitely forcible graph limits ⋮ Compactness and finite forcibility of graphons ⋮ Inducibility of directed paths ⋮ On the algebraic and topological structure of the set of Turán densities
Uses Software
This page was built for publication: A Solution to the 2/3 Conjecture
