On the Ramsey numbers of daisies I

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F24%3A00601764" target="_blank" >RIV/67985840:_____/24:00601764 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1017/S0963548324000221" target="_blank" >https://doi.org/10.1017/S0963548324000221</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1017/S0963548324000221" target="_blank" >10.1017/S0963548324000221</a>

Result language
angličtina
Original language name
On the Ramsey numbers of daisies I
Original language description
Daisies are a special type of hypergraph introduced by Bollobás, Leader and Malvenuto. An r-daisy determined by a pair of disjoint sets M is the (r+|K|)-uniform hypergraph {K∪:P∈Mr}. Bollobás, Leader and Malvenuto initiated the study of Turán type density problems for daisies. This paper deals with Ramsey numbers of daisies, which are natural generalisations of classical Ramsey numbers. We discuss upper and lower bounds for the Ramsey number of r-daisies and also for special cases where the size of the kernel is bounded.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)