Zobrazeno 1 - 10
of 227
pro vyhledávání: '"Vojtěch Rödl"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 17, Issue 4 (2021)
We show that for every $r \ge 2$ there exists $\epsilon_r > 0$ such that any $r$-uniform hypergraph with $m$ edges and maximum vertex degree $o(\sqrt{m})$ contains a set of at most $(\frac{1}{2} - \epsilon_r)m$ edges the removal of which breaks the h
Externí odkaz:
https://doaj.org/article/f63b1b3c4f7540ba83231ccde9a3b0b3
Publikováno v:
The Electronic Journal of Combinatorics. 29
In this paper we make a partial progress on the following conjecture: for every $\mu>0$ and large enough $n$, every Steiner triple system $S$ on at least $(1+\mu)n$ vertices contains every hypertree $T$ on $n$ vertices. We prove that the conjecture h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44ec942222de6b39279526957642049d
https://doi.org/10.37236/10454
https://doi.org/10.37236/10454
Publikováno v:
Procedia Computer Science. 195:412-418
We show that $3$-uniform hypergraphs with the property that all vertices have a quasirandom link graph with density bigger than $1/3$ contain a clique on five vertices. This result is asymptotically best possible.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d970e9e89efa6baa4a46358f0b13686
https://doi.org/10.1016/j.procs.2021.11.050
https://doi.org/10.1016/j.procs.2021.11.050
Autor:
Joanna Polcyn, Bjarne Schülke, Vojtěch Rödl, Andrzej Ruciński, Mathias Schacht, Christian Reiher
Publikováno v:
Acta Mathematica Hungarica
We show that every 4-uniform hypergraph with $n$ vertices and minimum pair degree at least $(5/9+o(1))n^2/2$ contains a tight Hamiltonian cycle. This degree condition is asymptotically optimal.
Dedicated to Endre Szemer\'edi on the occasion of h
Dedicated to Endre Szemer\'edi on the occasion of h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e8ef88951c461b87cc435123360a535
https://doi.org/10.1007/s10474-020-01078-7
https://doi.org/10.1007/s10474-020-01078-7
Publikováno v:
Discrete Mathematics. 342:3034-3042
Let F be a family of n -element sets. In 1995, Axenovich, Fon-Der-Flaass and Kostochka established an upper bound on the size of F that does not contain a Δ -system with q = 3 sets. Using the ideas of their proof we extend the results to an arbitrar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c20f9b60a48325a1929d38904a48c7b
https://doi.org/10.1016/j.disc.2019.06.013
https://doi.org/10.1016/j.disc.2019.06.013
Publikováno v:
Proceedings of the London Mathematical Society. 119:409-439
We show that every 3-uniform hypergraph with $n$ vertices and minimum vertex degree at least $(5/9+o(1))\binom{n}2$ contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal.
38
38
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f6142edd890357e98ba597cf22f4925
https://doi.org/10.1112/plms.12235
https://doi.org/10.1112/plms.12235
Autor:
Vojtěch Rödl, Domingos Dellamonica
Publikováno v:
SIAM Journal on Discrete Mathematics. 33:1669-1690
We prove that any Steiner triple system $\mathcal{S}$, with $n = v(\mathcal{S})$ sufficiently large, admits a packing by almost spanning paths that covers almost all edges. More formally, for any $...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c0c3251b193b2d64df0d75954c6cf8a
https://doi.org/10.1137/18m1202797
https://doi.org/10.1137/18m1202797
We show that every $k$-uniform hypergraph on $n$ vertices whose minimum $(k-2)$-degree is at least $(5/9+o(1))n^2/2$ contains a Hamiltonian cycle. A construction due to Han and Zhao shows that this minimum degree condition is optimal. The same result
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d4f0fbe95a8b11d327a2a7eb7d23850
Autor:
Bradley Elliott, Vojtěch Rödl
Publikováno v:
Journal of Combinatorial Designs. 27:82-105
In this paper we are interested in the following question: Given an arbitrary Steiner triple system $S$ on $m$ vertices and any 3-uniform hypertree $T$ on $n$ vertices, is it necessary that $S$ contains $T$ as a subgraph provided $m \geq (1+\mu)n$? W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7751ba9126c767b4387f83325801b61
https://doi.org/10.1002/jcd.21641
https://doi.org/10.1002/jcd.21641
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3f00d337260a546be9b4dbb8c4e999a
https://doi.org/10.1002/rsa.20783
https://doi.org/10.1002/rsa.20783