Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Andrii Arman"'
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:
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:
Journal of Combinatorial Theory, Series A. 183:105491
In this paper we study variations of an old result by M\"{u}ller, Reiterman, and the last author stating that a countable graph has a subgraph with infinite degrees if and only if in any labeling of the vertices (or edges) of this graph by positive i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04998b30d586e7ca379a41e8e41249c6
https://doi.org/10.1016/j.jcta.2021.105491
https://doi.org/10.1016/j.jcta.2021.105491
Autor:
Troy Retter, Andrii Arman
Publikováno v:
Journal of Combinatorial Theory, Series A. 147:18-26
Let r ( k ) denote the maximum number of edges in a k -uniform intersecting family with covering number k . Erdős and Lovasz proved that ⌊ k ! ( e − 1 ) ⌋ ≤ r ( k ) ≤ k k . Frankl, Ota, and Tokushige improved the lower bound to r ( k ) ≥
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b9e7eb9c53ccededa082620deb52ba7
https://doi.org/10.1016/j.jcta.2016.11.001
https://doi.org/10.1016/j.jcta.2016.11.001
Publikováno v:
Discrete Mathematics. 339:699-711
It is shown that for n ? 141 , among all triangle-free graphs on n vertices, the balanced complete bipartite graph K ? n / 2 ? , ? n / 2 ? is the unique triangle-free graph with the maximum number of cycles. Using modified Bessel functions, tight est
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c98cc6a55b1cad9d76c9beae86f0bc3
https://doi.org/10.1016/j.disc.2015.10.008
https://doi.org/10.1016/j.disc.2015.10.008
Autor:
Sergei Tsaturian, Andrii Arman
It is proved that if the points of the three-dimensional Euclidean space are coloured with red and blue, then there exist either two red points at unit distance, or six collinear blue points with distance one between any two consecutive points.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::235e1b4f2c2bc15f7bca04636491201d
Autor:
Andrii Arman, Vojtěch Rödl
Publikováno v:
Monash University
In this note we consider a Ramsey-type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao (2017).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00b6dce2572951ea370c47dae9f9d9a7
https://research.monash.edu/en/publications/26485ae0-25a2-4e0c-b362-c1c7c7dcfc2a
https://research.monash.edu/en/publications/26485ae0-25a2-4e0c-b362-c1c7c7dcfc2a