2 papers
math.CO2021
Clique number of Xor products of Kneser graphs
András Imolay, Anett Kocsis, Ádám Schweitzer
In this article we investigate a problem in graph theory, which has an equivalent reformulation in extremal set theory similar to the problems researched in "A general 2-part Erdős…
math.CO2020
Capacity of Lorentzian polynomials and distance to binomial distributions
Ádám Schweitzer
In this paper we study the capacity of Lorentzian polynomials. We give a new proof of a theorem of Brändén, Leake and Pak. Our approach is probabilistic in nature and uses a lemma…