Shagnik Das

Statistics

Publications

Citations

206

H-Index

Active since

2013

Affiliations

University of California, Los Angeles(Current)

ETH Zurich

Freie Universität Berlin

Shagnik Das is an author at University of California, Los Angeles specializing in discrete mathematics, combinatorial optimization, and computational complexity.

ORCID

Top concepts

Discrete MathematicsCombinatorial OptimizationEngineeringGraph TheoryComputational ComplexityMathematical ModelingEducationNetwork ScienceNetwork AnalysisMineral Processing

Publications per year

2013–2020

Publications

Intersecting families of discrete structures are typically trivial

József Balogh, Shagnik Das, Michelle Delcourt et al. · Journal of Combinatorial Theory Series A · 2015 · 34 citations

Combinatorial Design, Discrete Structures, Topological Combinatorics +2

Rainbow Turán problem for even cycles

Shagnik Das, Choongbum Lee, Benny Sudakov · European Journal of Combinatorics · 2013 · 32 citations

Geometry Of Number, Rainbow Turán Problem, Algebraic Combinatorics +2

A problem of Erdős on the minimum number of k -cliques

Shagnik Das, Hao Huang, Jie Ma et al. · Journal of Combinatorial Theory Series B · 2013 · 29 citations

Minimum Number, Network Science, Graph Theory +12

Sperner's Theorem and a Problem of Erdős, Katona and Kleitman

Shagnik Das, Wenying Gan, Benny Sudakov · Combinatorics Probability Computing · 2014 · 26 citations · Full text

Geometry Of Number, Engineering, Extremal Families +9

The minimum number of disjoint pairs in set systems and related problems

Shagnik Das, Wenying Gan, Benny Sudakov · COMBINATORICA · 2016 · 25 citations · Full text

Related Problems, Minimum Number, Engineering +8

1–5 of 8