Constrained Ramsey numbers

DOI10.1017/S0963548307008875MaRDI QIDQ5900849zbMATH OpenOpenAlexFDO

Authors Po-Shen Loh, Benny Sudakov

Publication date 23 April 2010

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548307008875

zbMATH Keywords

rainbow subgraphRamsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Recommendations

• Constrained Ramsey Numbers
• Constrained Ramsey numbers of graphs
• An Upper Bound for Constrained Ramsey Numbers
• Constrained Ramsey numbers for rainbow matching
• scientific article; zbMATH DE number 2148774

Cites work

• A Combinatorial Theorem
• An Upper Bound for Constrained Ramsey Numbers
• Complete graphs with no rainbow path
• Constrained Ramsey numbers of graphs
• Finding a monochromatic subgraph or a rainbow path
• Linear upper bounds for local Ramsey numbers
• Local k-colorings of graphs and hypergraphs
• Mono-multi bipartite Ramsey numbers, designs, and matrices
• On pattern Ramsey numbers of graphs
• Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
• Ramsey numbers for local colorings

Cited in

(7)

• Constrained Ramsey numbers for rainbow matching
• scientific article; zbMATH DE number 2148774 (Why is no real title available?)
• Constrained Ramsey numbers of graphs
• An Upper Bound for Constrained Ramsey Numbers
• Constrained Ramsey Numbers
• Constrained Ramsey numbers for the loose path, cycle and star
• Canonical Ramsey numbers of sparse graphs

This page was built for publication: Constrained Ramsey numbers

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