Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Dennis Clemens"'
Autor:
Anurag Bishnoi, Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta, Thomas Lesgourgues, Anita Liebenau
Publikováno v:
Thomas Lesgourgues
A graph $G$ is said to be $q$-Ramsey for a $q$-tuple of graphs $(H_1,\ldots,H_q)$, denoted by $G\to_q(H_1,\ldots,H_q)$, if every $q$-edge-coloring of $G$ contains a monochromatic copy of $H_i$ in color $i,$ for some $i\in[q]$. Let $s_q(H_1,\ldots,H_q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb99b23fe9489453e762239dd02f5c29
https://doi.org/10.1137/21m1444953
https://doi.org/10.1137/21m1444953
Publikováno v:
SIAM Journal on Discrete Mathematics. 36:1503-1528
Given any graph $H$, a graph $G$ is said to be $q$-Ramsey for $H$ if every coloring of the edges of $G$ with $q$ colors yields a monochromatic subgraph isomorphic to $H$. Further, such a graph $G$ is said to be minimal $q$-Ramsey for $H$ if additiona
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e24d3a7a8b1ff085e865bf071984d357
https://doi.org/10.1137/21m1393273
https://doi.org/10.1137/21m1393273
Publikováno v:
Discrete Mathematics. 346:113478
We initiate the study of a new variant of the Maker-Breaker positional game, which we call multistage game. Given a hypergraph $\mathcal{H}=(\mathcal{X},\mathcal{F})$ and a bias $b \ge 1$, the $(1:b)$ multistage Maker-Breaker game on $\mathcal{H}$ is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bbd24e07c2b73b42039e6cb0fce54282
https://doi.org/10.1016/j.disc.2023.113478
https://doi.org/10.1016/j.disc.2023.113478
Autor:
Giada Baldessarelli, Candace Jones, Ileana Stigliani, Elena Bruni, Anders Dahl Krabbe, Mercedes McBride, Dennis Clemens Jancsary, Renate Elisabeth Meyer, John Paul Stephens
Publikováno v:
Academy of Management Proceedings. 2022
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::077d72f7884407ad6feaca46cb98c59e
https://doi.org/10.5465/ambpp.2022.13363symposium
https://doi.org/10.5465/ambpp.2022.13363symposium
Publikováno v:
SIAM Journal on Discrete Mathematics. 35:2723-2748
Maker-Breaker games are played on a hypergraph $(X,\mathcal{F})$, where $\mathcal{F} \subseteq 2^X$ denotes the family of winning sets. Both players alternately claim a predefined amount of edges (...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea0d00745d68b066a3c4f2af782c13a7
https://doi.org/10.1137/20m1385044
https://doi.org/10.1137/20m1385044
Autor:
Pranshu Gupta, Fabian Hamann, Mirjana Mikalački, Alexander M. Haupt, Dennis Clemens, Yannick Mogge
Publikováno v:
Electronic Journal of Combinatorics 3 (27): P3.57, 1-35 (2020)
Waiter-Client games are played on some hypergraph $(X,\mathcal{F})$, where $\mathcal{F}$ denotes the family of winning sets. For some bias $b$, during each round of such a game Waiter offers to Client $b+1$ elements of $X$, of which Client claims one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::648d6a7802395a8bda7f09bc10bcab5f
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85092492991&origin=inward
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85092492991&origin=inward
Autor:
Damian Reding, Barnaby Roberts, Dennis Clemens, Matthew Jenssen, Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Natasha Morrison
Publikováno v:
Journal of Graph Theory. 91:290-299
Most of the work for this paper was done during my PhD, which was half funded by EPSRC grant reference 1360036, and half by Merton College Oxford. The third author was partially supported by FAPESP (Proc.~2013/03447-6) and by CNPq (Proc.~459335/2014-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1f04de7ac268fed1a0144db08f544a4
https://doi.org/10.1002/jgt.22432
https://doi.org/10.1002/jgt.22432
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
Waiter-Client games are played on a hypergraph \((X,\mathcal {F})\), where \(\mathcal {F} \subseteq 2^X\) denotes the family of winning sets. During each round, Waiter offers a predefined amount (called bias) of elements from the board X, from which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::895ff69285d9f71d2d306c940419ee64
https://doi.org/10.1007/978-3-030-83823-2_62
https://doi.org/10.1007/978-3-030-83823-2_62
Autor:
Margarita Pilkiene, Helena Nguyen, Mo Wang, Tijs Besieux, Irina Liuberté, Nate Zettna, Bernadeta Gostautaite, Dennis Clemens Jancsary, Karen Harlos, Amy C. Edmondson, Dovile Petreikiene, Yiduo Shao
Publikováno v:
Academy of Management Proceedings. 2021:10045
There is a growing research interest in the concept of silence that is broadly understood as employees’ self-censorship in communication with their managers. Though the phenomenon is important for ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fde42ce1e229a9ca9bb1d370c1db9554
https://doi.org/10.5465/ambpp.2021.10045symposium
https://doi.org/10.5465/ambpp.2021.10045symposium
Autor:
Anita Liebenau, Dennis Clemens
Publikováno v:
Journal of Combinatorial Theory, Series B. 122:21-54
In the Oriented-cycle game, introduced by Bollob\'as and Szab\'o, two players, called OMaker and OBreaker, alternately direct edges of $K_n$. OMaker directs exactly one edge, whereas OBreaker is allowed to direct between one and $b$ edges. OMaker win
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::680a786efcc0416541379fb4c04c901f
https://doi.org/10.1016/j.jctb.2016.05.002
https://doi.org/10.1016/j.jctb.2016.05.002