Vikram Kamat

Discret. Appl. Math., 2022

2020

An Erdős-Ko-Rado theorem for unions of length 2 paths.

[BibT_eX]

[DOI]

Carl Feghali

Discret. Math., 2020

2019

Cut-Colorings in Coloring Graphs.

[BibT_eX]

[DOI]

Prateek Bhakta

Benjamin Brett Buckner

Graphs Comb., 2019

Erdős-Ko-Rado theorems on the weak Bruhat lattice.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

Spotting Trees with Few Leaves.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

2015

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2013

An Erdős--Ko--Rado theorem for matchings in the complete graph

[BibT_eX]

[DOI]

CoRR, 2013

On the Parameterized Complexity of the Maximum Edge Coloring Problem.

[BibT_eX]

[DOI]

Prachi Goyal

CoRR, 2013

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem.

[BibT_eX]

[DOI]

Prachi Goyal

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012

Tight Co-Degree Condition for Perfect Matchings in 4-Graphs.

[BibT_eX]

[DOI]

Andrzej Czygrinow

Electron. J. Comb., 2012

2011

Erdos-Ko-Rado theorems for chordal graphs and trees.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

Stability Analysis for <i>k</i>-wise Intersecting Families.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

On cross-intersecting families of independent sets in graphs.

[BibT_eX]

[DOI]