Zobrazeno 1 - 10
of 83
pro vyhledávání: '"Gábor N. Sárközy"'
Autor:
Connor C. Anderson, Akshaj Balasubramanian, Henry Poskanzer, Daniel Reichman, Gábor N. Sárközy
Publikováno v:
Involve, a Journal of Mathematics. 16:59-68
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a6aeae157f487e88f09cf2fb183e601
https://doi.org/10.2140/involve.2023.16.59
https://doi.org/10.2140/involve.2023.16.59
Autor:
Gábor N. Sárközy
Publikováno v:
Acta Mathematica Hungarica. 161:412-426
An edge coloring of a graph is a local r-coloring if the edges incident to any vertex are colored with at most r distinct colors. In this paper, generalizing our earlier work, we study the following problem. Given a family of graphs $$\mathcal {F} $$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23258d9b6a7b605293a4f92460f61c55
https://doi.org/10.1007/s10474-020-01054-1
https://doi.org/10.1007/s10474-020-01054-1
Autor:
Gábor N. Sárközy
Publikováno v:
Graphs and Combinatorics. 38
We give a slight improvement on the size of a monochromatic double star we can guarantee in every r-coloring of the edges of $$K_n$$ K n .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88f064b7d3e8c7de9511f085833be8e1
https://doi.org/10.1007/s00373-022-02481-3
https://doi.org/10.1007/s00373-022-02481-3
Autor:
Gábor N. Sárközy
Publikováno v:
Discrete Mathematics. 346:113182
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::275ec9df0a5c6ba6b22b5ba9dd26652d
https://doi.org/10.1016/j.disc.2022.113182
https://doi.org/10.1016/j.disc.2022.113182
Autor:
András Gyárfás, Gábor N. Sárközy
Publikováno v:
Discrete Mathematics. 345:113025
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7cc1cc6fc066814bfbf01d40f981bd51
https://doi.org/10.1016/j.disc.2022.113025
https://doi.org/10.1016/j.disc.2022.113025
Publikováno v:
Journal of Graph Theory. 94:117-130
It is well-known that in every $r$-coloring of the edges of the complete bipartite graph $K_{m,n}$ there is a monochromatic connected component with at least ${m+n\over r}$ vertices. In this paper we study an extension of this problem by replacing co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eaba0cec789cbc62ed6985c2d64d7a59
https://doi.org/10.1002/jgt.22510
https://doi.org/10.1002/jgt.22510
Publikováno v:
IEEE BigData
Correlation-based analytics of time series data is important for a wide range of applications from stock analysis to weather forecasting. Yet performing these analytics at the granularity of subsequences of time series is prohibitively costly for lar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2cca1efb008dbfb6b92c5b23cbd969a
https://doi.org/10.1109/bigdata50022.2020.9378155
https://doi.org/10.1109/bigdata50022.2020.9378155
Autor:
Gábor N. Sárközy
Publikováno v:
Discrete Mathematics. 345:112712
The square of a path P is the graph obtained from P by joining every pair of vertices with distance 2 in P. We show that in every 2-colored complete graph on sufficiently many vertices the vertex set can be partitioned by at most 65 vertex disjoint m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7aaca843b11500671f5add760217f9d9
https://doi.org/10.1016/j.disc.2021.112712
https://doi.org/10.1016/j.disc.2021.112712
Publikováno v:
European Journal of Combinatorics. 99:103435
The Turan number of hypergraphs has been studied extensively. Here we deal with a recent direction, the linear Turan number, and restrict ourselves to linear triple systems, a collection of triples on a set of points in which any two triples intersec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2573d6788f41f7ef25bcdd78d84a7d6d
https://doi.org/10.1016/j.ejc.2021.103435
https://doi.org/10.1016/j.ejc.2021.103435
Autor:
Gábor N. Sárközy
Publikováno v:
Discrete Mathematics. 340:72-80
Improving our earlier result we show that for every integer k ≥ 1 there exists a c ( k ) such that in every 2-colored complete graph apart from at most c ( k ) vertices the vertex set can be covered by 200 k 2 log k vertex disjoint monochromatic k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c1b4f1f789e05496635904387912f7f
https://doi.org/10.1016/j.disc.2016.08.009
https://doi.org/10.1016/j.disc.2016.08.009