Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza
From MaRDI portal
Publication:6201025
DOI10.1002/jgt.23063arXiv2209.13867OpenAlexW4389607716MaRDI QIDQ6201025
Felix Christian Clemen, Maria A. Axenovich
Publication date: 25 March 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.13867
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Problems on cycles and colorings
- A note on planar difference sets
- On restricted colourings of \(K_ n\)
- On the geometry of planar difference sets
- The prime power conjecture is true for \(n<2,000,000\)
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
- Generalized Sidon sets
- An asymptotic version of the prime power conjecture for perfect difference sets
- Rainbow Turán Problems
- Rainbow subgraphs in properly edge‐colored graphs
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Additive Combinatorics
- Local Anti-Ramsey Numbers of Graphs
- An anti-Ramsey theorem
- Lower bounds for some Ramsey numbers
This page was built for publication: Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza
