activity
20172021
most citedSome results on domination number of the graph defined by two levels of the n-cube

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing 2018 · math.COShow all

1 paper · 2 filters

math.CO2018

Bounds on Erd{ő}s - Faber - Lovász Conjecture - the Uniform and Regular Cases

S. M. Hegde, Suresh Dara

We consider the Erd{ő}s - Faber - Lovász (EFL) conjecture for hypergraphs. This paper gives an upper bound for the chromatic number of regular linear hypergraphs o…