2 citations · 3 across the 3 of their papers we have counts for
6 papers
Positional games on randomly perturbed graphs
Dennis Clemens, Fabian Hamann, Yannick Mogge +1
Maker-Breaker games are played on a hypergraph , where denotes the family of winning sets. Both players alternately claim a predefined…
Anti-Ramsey threshold of cycles
Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Guilherme Oliveira Mota +1
For graphs and , let denote the property that for every proper edge colouring of there is a rainbow copy of in . Exte…
Random perturbation of sparse graphs
Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge +2
In the model of randomly perturbed graphs we consider the union of a deterministic graph with minimum degree and the binomial random graph . T…
More non-bipartite forcing pairs
Tamas Hubai, Dan Kral, Olaf Parczyk +1
We study pairs of graphs (H_1,H_2) such that every graph with the densities of H_1 and H_2 close to the densities of H_1 and H_2 in a random graph is quasirandom; such pairs (H_1,H…
2-universality in randomly perturbed graphs
Olaf Parczyk
A graph is called universal for a family of graphs if it contains every element as a subgraph. Let be the family of all gra…
Spanning structures and universality in sparse hypergraphs
Olaf Parczyk, Yury Person
In this paper the problem of finding various spanning structures in random hypergraphs is studied. We notice that a general result of Riordan [Spanning subgraphs of random graphs,…