Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs

DOI10.1002/JGT.22847zbMath1522.05299OpenAlexW4282826569WikidataQ114236128 ScholiaQ114236128MaRDI QIDQ6046647

Gui Ying Yan, Yu Cong Tang, Tong Li

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22847

zbMATH Keywords

stabilityhypergraphsexpansionsanti-Ramsey numberpaths and cycles

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Anti-Ramsey number of matchings in hypergraphs
• Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
• Turán problems and shadows. I: Paths and cycles
• Rainbow generalizations of Ramsey theory: A survey
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
• Hypergraph Turán numbers of linear cycles
• On maximal paths and circuits of graphs
• On families of finite sets no two of which intersect in a singleton
• Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
• An anti-Ramsey theorem

This page was built for publication: Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs