Karamjeet Singh

collaborators

4 papers

math.CO2025

Supports for Outerplanar and Bounded Treewidth Graphs

Rajiv Raman, Karamjeet Singh

We study the existence and construction of sparse supports for hypergraphs derived from subgraphs of a graph $G$ . For a hypergraph $(X, H)$ , a support $Q$ is a graph on $X…

math.CO2025

On Supports for graphs of bounded genus

Rajiv Raman, Karamjeet Singh

Let $(X, E)$ be a hypergraph. A support is a graph $Q$ on $X$ such that for each $E \in E$ , the subgraph of $Q$ induced on the elements in $E$ is connected. We con…

cs.CG2024

A fast algorithm for computing a planar support for non-piercing rectangles

Ambar Pal, Rajiv Raman, Saurabh Ray +1

For a hypergraph $H = (X, E)$ a \emph{support} is a graph $G$ on $X$ such that for each $E \in E$ , the induced subgraph of $G$ on the elements in $E$ is co…

math.CO2024

The complexity of recognizing $A B A B$ -free hypergraphs

Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi +1

The study of geometric hypergraphs gave rise to the notion of $A B A B$ -free hypergraphs. A hypergraph $H$ is called $A B A B$ -free if there is an ordering of its vertices such…

Supports for Outerplanar and Bounded Treewidth Graphs

On Supports for graphs of bounded genus

A fast algorithm for computing a planar support for non-piercing rectangles

The complexity of recognizing ABAB-free hypergraphs

The complexity of recognizing $A B A B$ -free hypergraphs