Naushad Pasha Puliyambalath

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+	Generalization of Erdős–Gallai edge bound	2014	Niraj Khare Nishali Mehta Naushad Pasha Puliyambalath
+	Maximum edges possible in a graph for restricted independence number, maximum degree, and maximum matching size	2012	Niraj Khare Nishali Mehta Naushad Pasha Puliyambalath

Common Coauthors

Coauthor	Papers Together
Niraj Khare	2
Nishali Mehta	2

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Graphs with restricted valency and matching number	2008	Niranjan Balachandran Niraj Khare	2
+	On the size of graphs with complete‐factors	1985	Jin Akiyama Péter Frankl	2
+	Degrees and matchings	1976	Vašek Chvátal D. L. Hanson	2
+	Matching Theory (North-Holland mathematics studies)	1986	László Lovász	1
+	On the size of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mn>3</mml:mn></mml:math>-uniform linear hypergraphs	2014	Niraj Khare	1
+	Improved bounds for Erdősʼ Matching Conjecture	2013	Péter Frankl	1