Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Haslegrave A."'
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions of bounded-degree bipartite graphs with a mild separability condition. As corollaries, we answer several questions of Reed and Wood on embedding sparse minors. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2791bc2a00bef882fe4a6586cae61fd3
http://wrap.warwick.ac.uk/155899/1/WRAP-extremal-density-sparse-minors-subdivisions-Haslegrave-2021.pdf
http://wrap.warwick.ac.uk/155899/1/WRAP-extremal-density-sparse-minors-subdivisions-Haslegrave-2021.pdf
Autor:
John Haslegrave
The Unfriendly Partition Conjecture posits that every countable graph admits a 2-colouring in which for each vertex there are at least as many bichromatic edges containing that vertex as monochromatic ones. This is not known in general, but it is kno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3cf2754fc3cea8725121fe0a896d3ae
http://arxiv.org/abs/2003.10408
http://arxiv.org/abs/2003.10408
Publikováno v:
Discrete Mathematics. 339:2804-2811
We consider a game in which a cop searches for a moving robber on a graph using distance probes, which is a slight variation on one introduced by Seager. Carragher, Choi, Delcourt, Erickson and West showed that for any n-vertex graph $G$ there is a w
Autor:
John Haslegrave, Jonathan Jordan
Publikováno v:
Electron. Commun. Probab.
Electronic Communications in Probability
Electronic Communications in Probability
We consider the preferential attachment model with multiple vertex types introduced by Antunovi\'c, Mossel and R\'acz. We give an example with three types, based on the game of rock-paper-scissors, where the proportions of vertices of the different t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e833f29d6c00f9b975199416f758349
https://eprints.whiterose.ac.uk/133860/8/Non-convergence.pdf
https://eprints.whiterose.ac.uk/133860/8/Non-convergence.pdf
Autor:
John Haslegrave, Chris Cannings
We consider a system in which a group of agents represented by the vertices of a graph synchronously update their opinion based on that of their neighbours. If each agent adopts a positive opinion if and only if that opinion is sufficiently popular a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d31708c18dda75fc399d424dbb775a07
https://eprints.whiterose.ac.uk/114361/1/1606.05496v1.pdf
https://eprints.whiterose.ac.uk/114361/1/1606.05496v1.pdf
Autor:
John Haslegrave
The vertices of any graph with m edges may be partitioned into two parts so that each part meets at least $$\tfrac{{2m}} {3}$$ edges. Bollobas and Thomason conjectured that the vertices of any r-uniform hypergraph with m edges may likewise be partiti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::727df2bf405453614e3c27bbea4e5e84
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
John Haslegrave
Publikováno v:
Combinatorica. 32:451-471
The vertices of any graph with $m$ edges can be partitioned into two parts so that each part meets at least $\frac{2m}{3}$ edges. Bollob\'as and Thomason conjectured that the vertices of any $r$-uniform graph may be likewise partitioned into $r$ clas
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We consider a game in which a cop searches for a moving robber on a graph using distance probes, studied by Carragher, Choi, Delcourt, Erickson and West, which is a slight variation on one introduced by Seager. Carragher, Choi, Delcourt, Erickson and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::23ea356ffa70c528e374d3c4e0100bfe
http://arxiv.org/abs/1311.3867
http://arxiv.org/abs/1311.3867