Constrained Ramsey Numbers (Q5900849)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 5700328

Language	Label	Description	Also known as
English	Constrained Ramsey Numbers	scientific article; zbMATH DE number 5700328

Statements

scholarly article

0 references

Constrained Ramsey Numbers (English)

0 references

0 references

Benjamin Sudakov

0 references

Combinatorics, Probability and Computing

0 references

publication date

23 April 2010

0 references

zbMATH Keywords

Ramsey number

0 references

rainbow subgraph

0 references

MaRDI profile type

MaRDI publication profile

0 references

Linear upper bounds for local Ramsey numbers

0 references

Complete graphs with no rainbow path

0 references

Local \(k\)-colorings of graphs and hypergraphs

0 references

On pattern Ramsey numbers of graphs

0 references

Constrained Ramsey numbers of graphs

0 references

A Combinatorial Theorem

0 references

Ramsey numbers for local colorings

0 references

Finding a monochromatic subgraph or a rainbow path

0 references

Mono-multi bipartite Ramsey numbers, designs, and matrices

0 references

Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints

0 references

An Upper Bound for Constrained Ramsey Numbers

0 references

full work available at URL

https://doi.org/10.1017/s0963548307008875

0 references

Identifiers

zbMATH Open document ID

0 references

10.1017/S0963548307008875

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5900849

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5900849&oldid=37244531"