Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Gyula O. H. Katona"'
Autor:
Gyula O. H. Katona
Publikováno v:
Opuscula Mathematica, Vol 37, Iss 4, Pp 577-588 (2017)
A two-part extension of the famous Erdȍs-Ko-Rado Theorem is proved. The underlying set is partitioned into \(X_1\) and \(X_2\). Some positive integers \(k_i\), \(\ell_i\) (\(1\leq i\leq m\)) are given. We prove that if \(\mathcal{F}\)) is an interse
Externí odkaz:
https://doaj.org/article/35b734fcb0964470ba94eab74169ecd7
Publikováno v:
Discrete Applied Mathematics. 307:1-14
The Turan number of a graph H , ex ( n , H ) , is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. Let P k be the path with k vertices, the square P k 2 of P k is obtained by joining the pairs of vertices with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db9f093ad9a002f6a7fc62cdc9c120a5
https://doi.org/10.1016/j.dam.2021.10.003
https://doi.org/10.1016/j.dam.2021.10.003
Autor:
Máté Vizer, Dániel T. Nagy, Gyula O. H. Katona, Balázs Keszegh, Balázs Patkós, Dániel Lenger, Dániel Gerbner, Gábor Wiener, Abhishek Methuku, Gábor Damásdi, Dömötör Pálvölgyi
Publikováno v:
Discrete Applied Mathematics. 288:235-245
Suppose that the vertices of a graph G are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority vertex. We st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e61b096e7b02a789a13fa0140bf57546
https://doi.org/10.1016/j.dam.2020.09.003
https://doi.org/10.1016/j.dam.2020.09.003
Autor:
Gilles Zémor, Gyula O. H. Katona, János Körner, Andrew McGregor, Ryan Gabrys, Sihem Mesnager, Olgica Milenkovic, Lara Dolecek, Alexander Barg
Publikováno v:
IEEE Transactions on Information Theory. 67:3187-3189
There are few mathematicians whose contributions go beyond named conjectures and theorems: Vladimir Iosifovich Levenshtein ( , 1935–2017) is one such true exception. During the five decades of his active research career, he enriched combinatorics,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70a332d099266a695590f87af1d03112
https://doi.org/10.1109/tit.2021.3072555
https://doi.org/10.1109/tit.2021.3072555
Publikováno v:
Discrete Applied Mathematics. 266:30-37
Consider all k -element subsets and l -element subsets ( k > l ) of an n -element set as vertices of a bipartite graph. Two vertices are adjacent if the corresponding l -element set is a subset of the corresponding k -element set. Let G k , l denote
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e05999d776c5ff030aa79fad29b89d8c
https://doi.org/10.1016/j.dam.2019.02.006
https://doi.org/10.1016/j.dam.2019.02.006
Autor:
Gyula O. H. Katona
Publikováno v:
New Trends in Algebras and Combinatorics.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::735c44d37a17c3281fd4b4f45a58bff5
https://doi.org/10.1142/9789811215476_0011
https://doi.org/10.1142/9789811215476_0011
Autor:
Chuanqi Xiao, Gyula O. H. Katona
By the theorem of Mantel (1907) it is known that a graph with n vertices and ⌊ n 2 4 ⌋ + 1 edges must contain a triangle. A theorem of Erdős gives a strengthening: there are not only one, but at least ⌊ n 2 ⌋ triangles. We give a further imp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84310e9823292194822a25b105e46158
Autor:
Jimeng Xiao, Gyula O. H. Katona
Suppose k ≥ 2 is an integer. Let Yk be the poset with elements x1,x2,y1,y2,…,yk− 1 such that y1 < y2 < ⋯ < yk− 1 < x1,x2 and let $Y_{k}^{\prime }$ Y k ′ be the same poset but all relations reversed. We say that a family of subsets of [n]
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cc4346c47746fdf32b651d052025b8f
Autor:
Morteza Faghani, Gyula O. H. Katona
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 1, Pp 53-62 (2018)
Let G=(V,E) be a simple connected graph (without loops and multiple edges). The distance d(u,v) of two vertices u,v∈V is the number of edges in a shortest path between u and v. The Wiener index w(G...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95b102e3accf75c03bc86e67604eed7a
https://doaj.org/article/41ba0ff389354f73a5c6607c69089fb3
https://doaj.org/article/41ba0ff389354f73a5c6607c69089fb3
Autor:
Peter Frankl, Gyula O. H. Katona
Publikováno v:
Journal of Combinatorial Theory, Series A. 184:105510
Let n > k > t ≥ j ≥ 1 be integers. Let X be an n-element set, ( X k ) the collection of its k-subsets. A family F ⊂ ( X k ) is called t-intersecting if | F ∩ F ′ | ≥ t for all F , F ′ ∈ F . The j'th shadow ∂ j F is the collection of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6e081c20c7b81d81026ca99c11f7dad
https://doi.org/10.1016/j.jcta.2021.105510
https://doi.org/10.1016/j.jcta.2021.105510