Imdadullah Khan

activity

20112023

most citedA Multi-cascaded Model with Data Augmentation for Enhanced Paraphrase Detection in Short Texts

39 citations · 180 across the 23 of their papers we have counts for

collaborators

Showing 2011 · cs.DMShow all

2 papers · 2 filters

cs.DM2011★ 28 cited

Perfect Matchings in 4-uniform hypergraphs

Imdadullah Khan

A perfect matching in a 4-uniform hypergraph is a subset of $⌊ \frac{n}{4} ⌋$ disjoint edges. We prove that if $H$ is a sufficiently large 4-uniform hypergraph on $n = 4 k$ …

cs.DM2011★ 22 cited

Perfect matching in 3-uniform hypergraphs with large vertex degree

Imdadullah Khan

A perfect matching in a 3-uniform hypergraph on $n = 3 k$ vertices is a subset of $\frac{n}{3}$ disjoint edges. We prove that if $H$ is a 3-uniform hypergraph on $n = 3 k$ vertices such…