Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Nolibos, Denilson Amaral"'
Given integers $r \geq 2$, $k \geq 3$ and $2 \leq s \leq \binom{k}{2}$, and a graph $G$, we consider $r$-edge-colorings of $G$ with no copy of a complete graph $K_k$ on $k$ vertices where $s$ or more colors appear, which are called $\mathcal{P}_{k,s}
Externí odkaz:
http://arxiv.org/abs/2103.11892
Autor:
Nolibos, Denilson Amaral
Publikováno v:
Repositório Institucional da UnicampUniversidade Estadual de CampinasUNICAMP.
Orientadores: Andreia Cristina Ribeiro, Jose Plinio de Oliveira Santos
Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica
Made available in DSpace on
Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica
Made available in DSpace on
Externí odkaz:
http://repositorio.unicamp.br/jspui/handle/REPOSIP/306042
This book collects the extended abstracts of the accepted contributions to EuroComb21. A similar book is published at every edition of EuroComb (every two years since 2001) collecting the most recent advances in combinatorics, graph theory, and relat