Colored complete hypergraphs containing no rainbow Berge triangles

DOI10.20429/TAG.2019.060201zbMATH Open1429.05074OpenAlexW2974553096MaRDI QIDQ5205656FDOQ5205656

Colton Magnant

Publication date: 13 December 2019

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.20429/tag.2019.060201

Recommendations

• A note on Ramsey numbers for Berge-\(G\) hypergraphs
• scientific article
• Ramsey numbers of Berge-hypergraphs and related structures
• Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
• Extremal problems and results related to Gallai-colorings

zbMATH Keywords

graph Ramsey numbersGallai-Ramsey numbers

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10)

Cited In (3)

• Edge-colored complete graphs containing no properly colored odd cycles
• Gallai-Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles
• Constructive Methods in Gallai-Ramsey Theory for Hypergraphs

This page was built for publication: Colored complete hypergraphs containing no rainbow Berge triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205656)