8 citations · 38 across the 13 of their papers we have counts for
Showing 2013 · math.COShow all
2 papers · 2 filters
math.CO2013★ 5 cited
A Lower Bound on the Crossing Number of Uniform Hypergraphs
Anurag Anshu, Saswata Shannigrahi
In this paper, we consider the embedding of a complete -uniform geometric hypergraph with vertices in general position in , where each hyperedge is represented…
math.CO2013★ 4 cited
On the construction of non-2-colorable uniform hypergraphs
Jithin Mathews, Manas Kumar Panda, Saswata Shannigrahi
The problem of 2-coloring uniform hypergraphs has been extensively studied over the last few decades. An n-uniform hypergraph is not 2-colorable if its vertices can't be colored wi…