Balázs Patkós

activity

20242026

collaborators

10 papers

math.CO2026

Edge mappings of graphs: Ramsey type parameters

Yair Caro, BalÃ¡zs PatkÃ³s, Zsolt Tuza +1

In this paper, we launch a systematic study of parameters concerning edge mappings of graphs. Inspired by Ramsey's theorem, the quantity $m (G, H)$ is defined to be the smallest inte…

math.CO2025

Rainbow TurÃ¡n problems for forbidden subposets

BalÃ¡zs PatkÃ³s

A family $G$ of sets is a copy of a poset $(P, ⩽)$ if $(G, \subseteq)$ is isomorphic to $(P, ⩽)$ . The forbidden subposet problem asks for determini…

math.CO2025

Poset saturation of unions of chains

Shengjin Ji, BalÃ¡zs PatkÃ³s, Erfei Yue

A family $G$ of sets is a(n induced) copy of a poset $P = (P, ⩽)$ if there exists a bijection $b : P \to G$ such that $p ⩽ q$ holds if and only…

cs.DS2025

Finding the diameter of a tree with distance queries

DÃ¡niel Gerbner, AndrÃ¡s Imolay, Kartal Nagy +2

We study the number of distance queries needed to identify certain properties of a hidden tree $T$ on $n$ vertices. A distance query consists of two vertices $x, y$ , and the answer…

math.CO2025

Turán problems for simplicial complexes

Maria Axenovich, DÃ¡niel Gerbner, Dániel Gerbner +3

An abstract simplicial complex $F$ is a non-uniform hypergraph without isolated vertices, whose edge set is closed under taking subsets. The extremal number $\mathrm{ex}(n…

math.CO2025

Generalized saturation game

BalÃ¡zs PatkÃ³s, MiloÅ¡ StojakoviÄ, Jelena Stratijev +1

We study the following game version of the generalized graph TurÃ¡n problem. For two fixed graphs F and H, two players, Max and Mini, alternately claim unclaimed edges of the compl…