Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Andrew J. Uzzell"'
Autor:
Michael Ferrara, Ryan Martin, Florian Pfender, Michael Dairyko, Bernard Lidický, Andrew J. Uzzell
Publikováno v:
Journal of Graph Theory. 94:252-266
Bootstrap percolation is a deterministic cellular automaton in which vertices of a graph~$G$ begin in one of two states, "dormant" or "active". Given a fixed integer $r$, a dormant vertex becomes active if at any stage it has at least $r$ active neig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d8cbec640b58fe7bfe51f43cb2f51b0
https://doi.org/10.1002/jgt.22517
https://doi.org/10.1002/jgt.22517
Autor:
Andrew J. Uzzell
Publikováno v:
Combinatorics, Probability and Computing. 28:936-960
In $r$-neighbor bootstrap percolation on the vertex set of a graph $G$, a set $A$ of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least $r$ previously infected neighbors. When the elements of $A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54377dc2c6af82dbe131dfd8d669c421
https://doi.org/10.1017/s0963548319000130
https://doi.org/10.1017/s0963548319000130
Publikováno v:
The Electronic Journal of Combinatorics. 27
The poset $Y_{k, 2}$ consists of $k+2$ distinct elements $x_1$, $x_2$, \dots, $x_{k}$, $y_1$, $y_2$, such that $x_1 \le x_2 \le \cdots \le x_{k} \le y_1$, $y_2$. The poset $Y'_{k, 2}$ is the dual poset of $Y_{k, 2}$. The sum of the $k$ largest binomi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6577a2ffcbd18587789c7c9bac1e13b5
https://doi.org/10.37236/7680
https://doi.org/10.37236/7680
Publikováno v:
Random Structures & Algorithms. 54:676-720
In breakthrough results, Saxton-Thomason and Balogh-Morris-Samotij developed powerful theories of hypergraph containers. In this paper, we explore some consequences of these theories. We use a simp ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e273887ba2e8b93617045c28c761929b
https://doi.org/10.1002/rsa.20777
https://doi.org/10.1002/rsa.20777
Autor:
Svante Janson, Andrew J. Uzzell
Publikováno v:
Journal of Graph Theory. 84:386-407
We study limits of convergent sequences of string graphs, that is graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We also prove s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7181bb056643a62b8d82188829e4ee6
https://doi.org/10.1002/jgt.22031
https://doi.org/10.1002/jgt.22031
Autor:
Danny Rorabaugh, Anton Bernshteyn, Andrew J. Uzzell, Ryan Martin, Jonathan Rollin, Omid Khormali, Songling Shan
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 795-806 (2020)
An (r − 1, 1)-coloring of an r-regular graph G is an edge coloring (with arbitrarily many colors) such that each vertex is incident to r − 1 edges of one color and 1 edge of a different color. In this paper, we completely characterize all 4-regul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a4c4d8344a57e1dd38d26937e86bc70
https://doi.org/10.7151/dmgt.2149
https://doi.org/10.7151/dmgt.2149
Autor:
Andrew J. Uzzell, Mykhaylo Tyomkyn
Publikováno v:
Electronic Notes in Discrete Mathematics. 49:433-440
We study maximal $K_{r+1}$-free graphs $G$ of almost extremal size—typically, $e(G)=\operatorname{ex}(n,K_{r+1})-O(n)$. We show that any such graph $G$ must have a large amount of `symmetry': in particular, all but very few vertices of $G$ must hav
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ad7b55ade70be736d25cbf78c075c00
https://doi.org/10.1016/j.endm.2015.06.061
https://doi.org/10.1016/j.endm.2015.06.061
Publikováno v:
Random Structures & Algorithms. 47:1-29
We study the percolation time of the r-neighbour bootstrap percolation model on the discrete torus i¾?/ni¾?d. For t at most a polylog function of n and initial infection probabilities within certain ranges depending on t, we prove that the percolat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51207277f417d9d76aa8491fdde91a48
https://doi.org/10.1002/rsa.20529
https://doi.org/10.1002/rsa.20529
Autor:
Andrew J. Uzzell, Mykhaylo Tyomkyn
Publikováno v:
Graphs and Combinatorics. 29:1927-1942
We suggest a new type of problem about distances in graphs and make several conjectures. As a first step towards proving them, we show that for sufficiently large values of n and k, a graph on n vertices that has no three vertices pairwise at distanc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6bbf2bef245e7da2c750c8db45632097
https://doi.org/10.1007/s00373-012-1225-4
https://doi.org/10.1007/s00373-012-1225-4
Publikováno v:
Ann. Probab. 42, no. 4 (2014), 1337-1373
Let $r\in\mathbb{N}$. In $r$-neighbour bootstrap percolation on the vertex set of a graph $G$, vertices are initially infected independently with some probability $p$. At each time step, the infected set expands by infecting all uninfected vertices t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b101c961e5eb7618a7e54fa99011b50c
http://projecteuclid.org/euclid.aop/1404394066
http://projecteuclid.org/euclid.aop/1404394066
