Constrained Ramsey numbers for rainbow matching
From MaRDI portal
Publication:3005111
DOI10.1002/jgt.20517zbMath1217.05162OpenAlexW2033761742MaRDI QIDQ3005111
Publication date: 7 June 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20517
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ramsey numbers for local colorings
- Generalized local colorings of graphs
- The Ramsey number for stripes
- Constrained Ramsey numbers of graphs
- An Upper Bound for Constrained Ramsey Numbers
- A Combinatorial Theorem
- Toeplitz methods which sum a given sequence
- Constrained Ramsey Numbers
- Generalizations of some Ramsey-type theorems for matchings
This page was built for publication: Constrained Ramsey numbers for rainbow matching