Properly colored and rainbow copies of graphs with few cherries

DOI10.1016/j.endm.2015.06.043zbMath1346.05184arXiv1504.06176WikidataQ56226594 ScholiaQ56226594MaRDI QIDQ5890911

Jan Volec, Benjamin Sudakov

Publication date: 14 October 2016

Published in: Electronic Notes in Discrete Mathematics, Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.06176

zbMATH Keywords

spanning subgraphs; local lemma; rainbow and properly colored subgraphs; Ramsey-type problems; properly colored subgraphs; rainbow subgraphs

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C55: Generalized Ramsey theory

05D10: Ramsey theory

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)