Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Arès Méroueh"'
Autor:
Arès Méroueh
Publikováno v:
Journal of Graph Theory. 90:172-188
Recently Kostochka, Mubayi and Verstraete initiated the study of the Ramsey numbers of uniform loose cycles versus cliques. In particular they proved that $R(C^r_3,K^r_n) = \tilde{\theta}(n^{3/2})$ for all fixed $r\geq 3$. For the case of loose cycle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::323f461428c7ed26587cc4537320b443
https://doi.org/10.1002/jgt.22387
https://doi.org/10.1002/jgt.22387
Autor:
Arès Méroueh
Publikováno v:
Journal of Combinatorial Theory, Series A. 155:398-417
We prove that for every partially ordered set P, there exists a constant c ( P ) such that every family F of subsets of [ n ] ordered by inclusion which contains no induced copy of P satisfies ∑ F ∈ F 1 / ( n | F | ) ≤ c ( P ) .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c1c7fa723e4012c107414abf7880763
https://doi.org/10.1016/j.jcta.2017.11.002
https://doi.org/10.1016/j.jcta.2017.11.002
Autor:
Andrew Thomason, Arès Méroueh
Let $\chi_l(G)$ denote the list chromatic number of the $r$-uniform hypergraph~$G$. Extending a result of Alon for graphs, Saxton and the second author used the method of containers to prove that, if $G$ is simple and $d$-regular, then $\chi_l(G)\ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb4eb255b208db73c23400c6de35e994
http://arxiv.org/abs/1704.07907
http://arxiv.org/abs/1704.07907
