Zobrazeno 1 - 10
of 42
pro vyhledávání: '"András Pluhár"'
Autor:
András London, András Pluhár
Publikováno v:
Applied Network Science, Vol 8, Iss 1, Pp 1-12 (2023)
Abstract In their previous work, the authors considered the concept of random spanning tree intersection of complex networks (London and Pluhár, in: Cherifi, Mantegna, Rocha, Cherifi, Micciche (eds) Complex networks and their applications XI, Spring
Externí odkaz:
https://doaj.org/article/296b214a68e64e52aaa03ad42f6d3b48
Autor:
András London, András Pluhár
Publikováno v:
Complex Networks and Their Applications XI ISBN: 9783031211300
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ece547bed8e5186fdc37df5e5c36065a
https://doi.org/10.1007/978-3-031-21131-7_26
https://doi.org/10.1007/978-3-031-21131-7_26
Publikováno v:
Combinatorics, Probability and Computing. 30:444-459
A perfect Kr-tiling in a graph G is a collection of vertex-disjoint copies of the clique Kr in G covering every vertex of G. The famous Hajnal–Szemerédi theorem determines the minimum degree threshold for forcing a perfect Kr-tiling in a graph G.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa806d7ba4d9a1d2b7c62aa882e79789
https://doi.org/10.1017/s0963548320000516
https://doi.org/10.1017/s0963548320000516
Autor:
András Pluhár
Publikováno v:
Alkalmazott Matematikai Lapok. 37:225-232
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9aa71d83d5678f1d35b85278d5ebb185
https://doi.org/10.37070/aml.2020.37.2.07
https://doi.org/10.37070/aml.2020.37.2.07
Autor:
András Pluhár, Géza Makay
Publikováno v:
Acta Cybernetica. 24:187-195
A local food wholesaler company is using an automated commissioning system, which brings the bins containing the appropriate product to the commissioning counter, where the worker picks the needed amounts to 12 bins corresponding to the same number o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::481c9d0d2c032a6cfdc378f4f47b2410
https://doi.org/10.14232/actacyb.24.2.2019.2
https://doi.org/10.14232/actacyb.24.2.2019.2
We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges between the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbca3263bd757f8a3eabe1e2587136d5
http://arxiv.org/abs/2103.08005
http://arxiv.org/abs/2103.08005
Publikováno v:
Ars mathematica contemporanea
One of the most useful strategies for proving Breaker's win in Maker-Breaker Positional Games is to find a pairing strategy. In some cases there are no pairing strategies at all, in some cases there are unique or almost unique strategies. For the ?$k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f6823e5afc5418e2cc5213b5fa077f6
https://doi.org/10.26493/1855-3974.1350.990
https://doi.org/10.26493/1855-3974.1350.990
Autor:
András London, András Pluhár
Publikováno v:
Acta Cybernetica. 23:921-927
In this paper, we investigate special types of Maker-Breaker games defined on graphs. We restrict Maker’s possible moves that resembles the way that was introduced by Espig, Frieze, Krivelevich and Pedgen [9]. Here, we require that the subgraph ind
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0cdfd0d896e8fbc60ffa643b54a9111
https://doi.org/10.14232/actacyb.23.3.2018.12
https://doi.org/10.14232/actacyb.23.3.2018.12
Autor:
András Pluhár, Lajos Győrffy
Publikováno v:
Acta Universitatis Sapientiae: Mathematica, Vol 8, Iss 2, Pp 233-248 (2016)
In this paper we define a bridge between pairings and colorings of the hypergraphs by introducing a generalization of pairs called t-cakes for t ∈ ℕ, t ≥ 2. For t = 2 the 2-cakes are the same as the well-known pairs of system of distinct repres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f93fcfec3e4803ce3507608228e27e9
https://doaj.org/article/031d764e023843e9946491a20b0017a7
https://doaj.org/article/031d764e023843e9946491a20b0017a7
Two new versions of the so-called Maker-Breaker Positional Games are defined by J\'ozsef Beck in [{\em Combinatorica} {\bf 22}(2) (2002) 169--216]. He defines two players, Picker and Chooser. In each round, Picker takes a pair of elements not already
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3446483dd9551169aa0a81eed15c88f6