2 citations · 3 across the 5 of their papers we have counts for
6 papers · 1 filter
Upper Bounds on the Turán Density of Hypergraphs Associated with the Projective Plane over a Finite Field
Subhankar Dash, Kaushik Majumder
Let $\PG(2,q)$ denote the projective plane over the finite field where is a prime power. For a positive integer , let $B_{t}[\PG(2,q)]$ denote the -pa…
An Analytic counting Framework for the generalised Erdős box problem
Subhankar Dash, Kaushik Majumder
In this article, we develop an uniform analogue of the classical Kövári--Sós--Turán inequality. This yields an alternative proof of Erdős's classical upper bound for complete $…
On the Universality and Extremality of graphs with a distance constrained colouring
Kaushik Majumder, Ushnish Sarkar
A lambda colouring (or colouring) of a graph is an assignment of non-negative integers (with minimum assignment ) to its vertices such that the adjacent vertices must r…
A note on the transversal size of a series of families constructed over Cycle Graph
Kaushik Majumder, Satyaki Mukherjee
Paul Erdős and László Lovász established by means of an example that there exists a maximal intersecting family of sets with approximately blocks. László Lovász conje…
Closed Intersecting Families of finite sets and their applications
Kaushik Majumder
Paul Erdős and László Lovász established that any \emph{maximal intersecting family of sets} has at most blocks. They introduced the problem of finding the maximum poss…
On the maximum number of points in a maximal intersecting family of finite sets
Kaushik Majumder
Paul Erdős and László Lovász proved in a landmark article that, for any positive integer , up to isomorphism there are only finitely many maximal intersecting families of se…