Local Properties via Color Energy Graphs and Forbidden Configurations

DOI10.1137/18M1225987zbMath1431.05144arXiv1810.09019OpenAlexW2998803016WikidataQ126384929 ScholiaQ126384929MaRDI QIDQ5208745

Adam Sheffer, Cosmin Pohoata, Sara Fish

Publication date: 10 January 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theorydifference setsforbidden configurationscolor energylocal properties

Mathematics Subject Classification ID

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

Related Items (6)

Rainbow subgraphs in edge-colored planar and outerplanar graphs ⋮ Lower bounds on the Erdős–Gyárfás problem via color energy graphs ⋮ The Erdős–Gyárfás function with respect to Gallai‐colorings ⋮ Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles ⋮ Color Isomorphic Even Cycles and a Related Ramsey Problem ⋮ Progress on local properties problems of difference sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• More distinct distances under local conditions
• A variant of the classical Ramsey problem
• On edge colorings with at least \(q\) colors in every subset of \(p\) vertices
• Improved bounds for the extremal number of subdivisions
• Local properties in colored graphs, distinct distances, and difference sets
• The Erdős-Gyárfás problem on generalized Ramsey numbers
• A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
• A Note on Bipartite Graphs Without 2 k -Cycles
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression

This page was built for publication: Local Properties via Color Energy Graphs and Forbidden Configurations