Matches in SemOpenAlex for { <https://semopenalex.org/work/W3025561110> ?p ?o ?g. }
Showing items 1 to 56 of
56
with 100 items per page.
- W3025561110 endingPage "1" @default.
- W3025561110 startingPage "1" @default.
- W3025561110 abstract "Graph-bootstrap percolation, also known as weak saturation, was introduced by Bollobas in 1968. In this process, we start with initial set of edges $E_0$, and we infect new edges according to a predetermined rule. Given a graph $H$ and a set of previously infected edges $E_tsubseteq E(K_n)$, we infect a non-infected edge $e$ if it completes a new copy of $H$ in $G=([n],E_tcup e)$. A question raised by Bollobas asks for the maximum time the process can run before it stabilizes. Bollobas, Przykucki, Riordan, and Sahasrabudhe considered this problem for the most natural case where $H=K_r$. They answered the question for $rleq 4$ and gave a non-trivial lower bound for every $rgeq 5$. They also conjectured that the maximal running time is $o(n^2)$ for every integer $r$. In this paper we disprove their conjecture for every $rgeq 6$ and we give a better lower bound for the case $r=5$; in the proof we use the Behrend construction." @default.
- W3025561110 created "2020-05-21" @default.
- W3025561110 creator A5012454851 @default.
- W3025561110 creator A5031871168 @default.
- W3025561110 creator A5059910732 @default.
- W3025561110 creator A5078906046 @default.
- W3025561110 date "2020-05-10" @default.
- W3025561110 modified "2023-09-25" @default.
- W3025561110 title "The maximum length of $K_r$-bootstrap percolation" @default.
- W3025561110 doi "https://doi.org/10.1090/proc/15130" @default.
- W3025561110 hasPublicationYear "2020" @default.
- W3025561110 type Work @default.
- W3025561110 sameAs 3025561110 @default.
- W3025561110 citedByCount "1" @default.
- W3025561110 crossrefType "journal-article" @default.
- W3025561110 hasAuthorship W3025561110A5012454851 @default.
- W3025561110 hasAuthorship W3025561110A5031871168 @default.
- W3025561110 hasAuthorship W3025561110A5059910732 @default.
- W3025561110 hasAuthorship W3025561110A5078906046 @default.
- W3025561110 hasBestOaLocation W30255611101 @default.
- W3025561110 hasConcept C105795698 @default.
- W3025561110 hasConcept C121332964 @default.
- W3025561110 hasConcept C121864883 @default.
- W3025561110 hasConcept C15744967 @default.
- W3025561110 hasConcept C169760540 @default.
- W3025561110 hasConcept C2780457167 @default.
- W3025561110 hasConcept C33923547 @default.
- W3025561110 hasConceptScore W3025561110C105795698 @default.
- W3025561110 hasConceptScore W3025561110C121332964 @default.
- W3025561110 hasConceptScore W3025561110C121864883 @default.
- W3025561110 hasConceptScore W3025561110C15744967 @default.
- W3025561110 hasConceptScore W3025561110C169760540 @default.
- W3025561110 hasConceptScore W3025561110C2780457167 @default.
- W3025561110 hasConceptScore W3025561110C33923547 @default.
- W3025561110 hasLocation W30255611101 @default.
- W3025561110 hasLocation W30255611102 @default.
- W3025561110 hasLocation W30255611103 @default.
- W3025561110 hasLocation W30255611104 @default.
- W3025561110 hasOpenAccess W3025561110 @default.
- W3025561110 hasPrimaryLocation W30255611101 @default.
- W3025561110 hasRelatedWork W1967921804 @default.
- W3025561110 hasRelatedWork W1975826565 @default.
- W3025561110 hasRelatedWork W1995837010 @default.
- W3025561110 hasRelatedWork W2032946328 @default.
- W3025561110 hasRelatedWork W2084110455 @default.
- W3025561110 hasRelatedWork W2119158312 @default.
- W3025561110 hasRelatedWork W2552050053 @default.
- W3025561110 hasRelatedWork W2949171345 @default.
- W3025561110 hasRelatedWork W3100181845 @default.
- W3025561110 hasRelatedWork W3102564941 @default.
- W3025561110 isParatext "false" @default.
- W3025561110 isRetracted "false" @default.
- W3025561110 magId "3025561110" @default.
- W3025561110 workType "article" @default.