Color Isomorphic Even Cycles and a Related Ramsey Problem
From MaRDI portal
Publication:5128499
DOI10.1137/20M1329652zbMath1450.05027arXiv2004.01932MaRDI QIDQ5128499
Gennian Ge, Yifan Jing, Tao Zhang, Zixiang Xu
Publication date: 27 October 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.01932
Extremal problems in graph theory (05C35) Polynomials over finite fields (11T06) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (3)
Rainbow subgraphs in edge-colored planar and outerplanar graphs ⋮ Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles ⋮ On color isomorphic subdivisions
Cites Work
- Unnamed Item
- Unnamed Item
- More distinct distances under local conditions
- Linearly many rainbow trees in properly edge-coloured complete graphs
- On a class of degenerate extremal graph problems
- On multicolor Ramsey numbers for complete bipartite graphs
- A variant of the classical Ramsey problem
- On edge colorings with at least \(q\) colors in every subset of \(p\) vertices
- Cycles of even length in graphs
- On generalized Ramsey theory: The bipartite case
- Improved bounds for the extremal number of subdivisions
- More on the extremal number of subdivisions
- A polynomial approach to linear algebra
- Generalized Ramsey numbers: forbidding paths with few colors
- Local properties in colored graphs, distinct distances, and difference sets
- The Erdős-Gyárfás problem on generalized Ramsey numbers
- Random algebraic construction of extremal graphs
- Decompositions into spanning rainbow structures
- Turán numbers of theta graphs
- Ramsey-Type Problem for an Almost Monochromatic $K_4$
- Local Properties via Color Energy Graphs and Forbidden Configurations
- On a problem of K. Zarankiewicz
- Number of Points of Varieties in Finite Fields
This page was built for publication: Color Isomorphic Even Cycles and a Related Ramsey Problem
