Máté Vizer

activity

20122022

most citedSome exact results for regular Turán problems

3 citations · 7 across the 12 of their papers we have counts for

collaborators

Showing math.COShow all

29 papers · 1 filter

math.CO2022★ 1 cited

On ordered Ramsey numbers of tripartite 3-uniform hypergraphs

Martin Balko, Máté Vizer

For an integer $k \geq 2$ , an ordered $k$ -uniform hypergraph $H = (H, <)$ is a $k$ -uniform hypergraph $H$ together with a fixed linear ordering $<$ of its vertex set. The or…

math.CO2022

On graphs that contain exactly k copies of a subgraph, and a related problem in search theory

Dániel Gerbner, Balázs Keszegh, Dániel Lenger +5

We study $exa_{k} (n, F)$ , the largest number of edges in an $n$ -vertex graph $G$ that contains exactly $k$ copies of a given subgraph $F$ . The case $k = 0$ is the Turán number…

math.CO2021

On saturation of Berge hypergraphs

Dániel Gerbner, Balázs Patkós, Zsolt Tuza +1

A hypergraph $H = (V (H), E (H))$ is a Berge copy of a graph $F$ , if $V (F) \subset V (H)$ and there is a bijection $f : E (F) \to E (H)$ such that for any $e \in E (F)$ we have $e\subse…

math.CO2021

Forbidden subposet problems in the grid

Dániel Gerbner, Dániel T. Nagy, Balázs Patkós +1

For posets $P$ and $Q$ , extremal and saturation problems about weak and strong $P$ -free subposets of $Q$ have been studied mostly in the case $Q$ is the Boolean poset $Q_{n}$ , the po…

math.CO2020

Saturation problems with regularity constraints

Dániel Gerbner, Balázs Patkós, Zsolt Tuza +1

For a graph $F$ , we say that another graph $G$ is $F$ -saturated, if $G$ is $F$ -free and adding any edge to $G$ would create a copy of $F$ . We study for a given graph $F$ and intege…

math.CO2020

Supersaturation, counting, and randomness in forbidden subposet problems

Dániel Gerbner, Dániel Nagy, Balázs Patkós +1

In the area of forbidden subposet problems we look for the largest possible size $L a (n, P)$ of a family $F \subseteq 2^{[n]}$ that does not contain a forbidden inclusion pa…