Zolt'an Kir'aly

activity

20182020

collaborators

3 papers

math.CO2020

Upper bounds for the necklace folding problems

Endre Csóka, Zoltán L. Blázsik, Zoltán Király +1

A necklace can be considered as a cyclic list of $n$ red and $n$ blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs…

math.CO2019

Problems and results on 1-cross intersecting set pair systems

Zoltán Füredi, András Gyárfás, Zoltán Király

The notion of cross intersecting set pair system of size $m$ , $({A_{i}}_{i = 1}^{m}, {B_{i}}_{i = 1}^{m})$ with $A_{i} \cap B_{i} = \emptyset$ and $A_{i} \cap B_{j} \neq = \emptyset$ , was introduce…

math.CO2018

The Manickam-Miklós-Singhi Parameter of Graphs and Degree Sequences

Zoltán Király, Neeraja Kulkarni, Ian McMeeking +1

Let $G$ be a simple graph. Consider all weightings of the vertices of $G$ with real numbers whose total sum is nonnegative. How many edges of $G$ have endpoints with a nonnegative…