Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs
Given a graph $ G $, a graph $ F $ is said to be Ramsey for $ G $ if in every edge coloring of $F$ with two colors, there exists a monochromatic copy of $G$. The minimum number of edges of a graph $ F $ which is Ramsey for $ G $ is called the size-Ramsey number of $G$ and is denoted by $\hat{r}(G)$....
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
University of Isfahan
2019-06-01
|
| coleção: | Transactions on Combinatorics |
| Assuntos: | |
| Acesso em linha: | https://toc.ui.ac.ir/article_23587_0eee51d79c968b062c8447e82c3f56ac.pdf |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|