Constrained Ramsey Numbers
From MaRDI portal
Publication:5900849
DOI10.1017/S0963548307008875zbMath1191.05065OpenAlexW2152184602MaRDI QIDQ5900849
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
Related Items (2)
Constrained Ramsey numbers for the loose path, cycle and star ⋮ Constrained Ramsey numbers for rainbow matching
Cites Work
- On pattern Ramsey numbers of graphs
- Mono-multi bipartite Ramsey numbers, designs, and matrices
- Linear upper bounds for local Ramsey numbers
- Ramsey numbers for local colorings
- Local \(k\)-colorings of graphs and hypergraphs
- Finding a monochromatic subgraph or a rainbow path
- Complete graphs with no rainbow path
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Constrained Ramsey numbers of graphs
- An Upper Bound for Constrained Ramsey Numbers
- A Combinatorial Theorem
This page was built for publication: Constrained Ramsey Numbers