1 citations · 1 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2023
A Note on Hamiltonian-Intersecting Families of Graphs
Imre Leader, Žarko Ranđelović, Ta Sheng Tan
How many graphs on an -point set can we find such that any two have connected intersection? Berger, Berkowitz, Devlin, Doppelt, Durham, Murthy and Vemuri showed that the maximum…
math.CO2023
Minimizing the Number of Unions
Žarko Ranđelović
For a given number of -sets, how should we choose them so as to minimize the union-closed family that they generate? Our main aim in this paper is to show that, if …
math.CO2019
Inequalities on Projected Volumes
Imre Leader, Žarko Ranđelović, Eero Räty
In this paper we study the following geometric problem: given real numbers indexed by the non-empty subsets , is it possible to construct a body…