Home > Search Results: keywords:"wsat|weak saturation|hypergraph|extremal combinatorics"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.02 seconds. 
Weak saturation processes in multipartite hypergraphs
 Rajský, Adam ; Tyomkyn, Mykhaylo (advisor) ; Tancer, Martin (referee)
Given hypergraphs H and P, wsat(H, P) denotes the smallest number of edges in a subgraph of H with the property that the missing edges can be sequentially added such that the addition of every edge creates a new copy of P. In 1985 Alon proved that wsat(Kn, P)/n tends to a finite limit for any graph P. A generalisation of this Theorem to r-uniform hypergraphs was conjectured by Tuza in 1992 and proved by Shapira and Tyomkyn in 2021. In this thesis, we use the methodology introduced by Shapira and Tyomkyn to prove a similar theorem when H is a complete r-partite r- uniform hypergraph.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English