Balázs Keszegh

activity

20092026

most citedInduced and non-induced poset saturation problems

29 citations · 74 across the 56 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017

Coloring intersection hypergraphs of pseudo-disks

Balázs Keszegh

We prove that the intersection hypergraph of a family of $n$ pseudo-disks with respect to another family of pseudo-disks admits a proper coloring with $4$ colors and a conflict-fre…

math.CO2017★ 1 cited

An improvement on the maximum number of $k$ -Dominating Independent Sets

Dániel Gerbner, Balázs Keszegh, Abhishek Methuku +2

Erdős and Moser raised the question of determining the maximum number of maximal cliques or equivalently, the maximum number of maximal independent sets in a graph on $n$ vertices.…

math.CO2017

Generalized forbidden subposet problems

Daniel Gerbner, Balazs Keszegh, Balazs Patkos

A subfamily ${F_{1}, F_{2}, \dots, F_{∣ P ∣}} \subseteq F$ of sets is a copy of a poset $P$ in $F$ if there exists a bijection $ϕ : P \to {F_{1}, F_{2}, \dots, F_{∣ P ∣}}$ such…

Coloring intersection hypergraphs of pseudo-disks

An improvement on the maximum number of k-Dominating Independent Sets

Generalized forbidden subposet problems

An improvement on the maximum number of $k$ -Dominating Independent Sets