Agnijo Banerjee

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	The Complexity of Decomposing a Graph into a Matching and a Bounded Linear Forest	2025	Agnijo Banerjee João Pedro Marciano Adva Mond Jan Petr Julien Portier
+ PDF Chat	A Proof of a Frankl–Kupavskii Conjecture on Intersecting Families	2024	Agnijo Banerjee
+	The complexity of decomposing a graph into a matching and a bounded linear forest	2023	Agnijo Banerjee João Pedro Marciano Adva Mond Jan Petr Julien Portier
+	A proof of a Frankl-Kupavskii conjecture on intersecting families	2023	Agnijo Banerjee

Common Coauthors

Coauthor	Papers Together
João Pedro Marciano	2
Julien Portier	2
Adva Mond	2
Jan Petr	1
Jan Petr	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Matching: A Well-Solved Class of Integer Linear Programs	2003	Jack Edmonds Ellis L. Johnson	1
+	The Complete Intersection Theorem for Systems of Finite Sets	1997	Rudolf Ahlswede Levon H. Khachatrian	1
+	Graph decomposition is NPC - a complete proof of Holyer's conjecture	1992	Dorit Dor Michael Tarsi	1
+	Decomposition of Finite Graphs Into Forests	1964	C. St. J. A. Nash‐Williams	1
+ PDF Chat	On linear k-arboricity	1984	J Bermond Jean‐Luc Fouquet Michel Habib Bernard Péroche	1
+	General factors of graphs	1988	Gérard Cornuéjols	1
+	Covering planar graphs with forests, one having bounded maximum degree	2008	Daniel Gonçalves	1
+	Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5	1999	Carsten Thomassen	1
+ PDF Chat	A Short Proof of the Factor Theorem for Finite Graphs	1954	W. T. Tutte	1
+	Covering and packing in graphs. III: Cyclic and acyclic invariants	1980	Jin Akiyama Geoffrey Exoo Frank Harary	1
+ PDF Chat	Incompatible Intersection Properties	2019	Péter Frankl Andrey Kupavskii	1
+ PDF Chat	Subcubic planar graphs of girth 7 are class I	2022	Sebastien Bonduelle František Kardoš	1
+ PDF Chat	Partitioning edges of a planar graph into linear forests and a matching	2023	Marthe Bonamy Jadwiga Czyżewska Łukasz Kowalik Michał Pilipczuk	1
+ PDF Chat	An Improved Bound for the Linear Arboricity Conjecture	2023	Richard Lang Luke Postle	1
+ PDF Chat	Decompositions into two linear forests of bounded lengths	2024	Rutger Campbell Florian Hörsch Benjamin Moore	1