Colored complete hypergraphs containing no rainbow Berge triangles

DOI10.20429/TAG.2019.060201MaRDI QIDQ5205656zbMATH OpenOpenAlexFDO

Authors Colton Magnant

Publication date 13 December 2019

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

Copyright license Creative Commons Attribution 4.0 International

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

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)

Recommendations

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

Cited in

(4)

• 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
• An upper bound for a Ramsey type problem for k-connected subgraphs
• 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)