5 papers
Moments of permutation statistics and central limit theorems
Stoyan Dimitrov, Niraj Khare
We show that if a permutation statistic can be written as a linear combination of bivincular patterns, then its moments can be expressed as a linear combination of factorials with…
Size of a 3-uniform linear hypergraph
Niraj Khare
This article provides bounds on the size of a 3-uniform linear hypergraph with restricted matching number and maximum degree. In particular, we show that if a 3-uniform, linear fam…
Graphs whose edge set can be partitioned into maximum matchings
Niraj Khare
This article provides structural characterization of simple graphs whose edge-set can be partitioned into maximum matchings. We use Vizing's classification of simple graphs based o…
Maximum edges possible in a graph for restricted independence number, maximum degree, and maximum matching size
Niraj Khare, Nishali Mehta, Naushad Puliyambalath
This article provides sharp bounds for the maximum number of edges possible in a simple graph with restricted values of two of the three parameters, namely, maxi- mum matching size…
Graphs with restricted valency and matching number
Niranjan Balachandran, Niraj Khare
Consider the family of all finite graphs with maximum degree and matching number . In this paper we give a new proof to obtain the exact upper bound for the number…