Dániel T. Nagy

activity

20172024

collaborators

Showing 2018Show all

5 papers · 1 filter

math.CO2018

On the maximum number of copies of H in graphs with given size and order

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

We study the maximum number $e x (n, e, H)$ of copies of a graph $H$ in graphs with given number of vertices and edges. We show that for any fixed graph $H$ , $e x (n, e, H)$ is asymptotica…

math.CO2018

Rainbow Ramsey problems for the Boolean lattice

Fei-Huang Chang, Dániel Gerbner, Wei-Tian Li +4

We address the following rainbow Ramsey problem: For posets $P, Q$ what is the smallest number $n$ such that any coloring of the elements of the Boolean lattice $B_{n}$ either admits…

math.CO2018

Vertex Turán problems for the oriented hypercube

Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy +2

In this short note we consider the oriented vertex Turán problem in the hypercube: for a fixed oriented graph $F$ , determine the maximum size $ex_v(\overrightarrow…

math.CO2018

On the number of containments in $P$ -free families

Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy +2

A subfamily ${F_{1}, F_{2}, \dots, F_{∣ P ∣}} \subseteq F$ is a copy of the poset $P$ if there exists a bijection $i : P \to {F_{1}, F_{2}, \dots, F_{∣ P ∣}}$ such that $p \leq_{P} q$ i…

math.CO2018

Stability results on vertex Turán problems in Kneser graphs

Dániel Gerbner, Abhishek Methuku, Dániel Nagy +2

The vertex set of the Kneser graph $K (n, k)$ is $V = (k [ n ])$ and two vertices are adjacent if the corresponding sets are disjoint. For any graph $F$ , the largest size of a v…

On the maximum number of copies of H in graphs with given size and order

Rainbow Ramsey problems for the Boolean lattice

Vertex Turán problems for the oriented hypercube

On the number of containments in P-free families

Stability results on vertex Turán problems in Kneser graphs

On the number of containments in $P$ -free families