On an anti‐Ramsey property of Ramanujan graphs
From MaRDI portal
Publication:4845079
DOI10.1002/rsa.3240060405zbMath0830.05047OpenAlexW2075196560WikidataQ105583204 ScholiaQ105583204MaRDI QIDQ4845079
Yoshiharu Kohayakawa, Penny E. Haxell
Publication date: 28 January 1996
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240060405
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items
Rainbow generalizations of Ramsey theory: A survey ⋮ Rainbows in the hypercube ⋮ On an anti-Ramsey threshold for random graphs ⋮ The size-Ramsey number of trees
Cites Work
- Unnamed Item
- Note on the girth of Ramanujan graphs
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Expanding graphs contain all small trees
- Explicit construction of linear sized tolerant networks
- Ramanujan graphs
- Eigenvalues and expanders
- On size Ramsey number of paths, trees, and circuits. I
- On the large sieve
- An anti-Ramsey theorem
