The following pages link to Vikram Kamat (Q426890):
Displaying 17 items.
- Tight co-degree condition for perfect matchings in 4-graphs (Q426891) (← links)
- Stability analysis for \(k\)-wise intersecting families (Q540125) (← links)
- Cut-colorings in coloring graphs (Q1733874) (← links)
- New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems (Q1744762) (← links)
- An Erdős-Ko-Rado theorem for unions of length 2 paths (Q2005709) (← links)
- Erdős-Ko-Rado theorems on the weak Bruhat lattice (Q2026320) (← links)
- On intersecting families of independent sets in trees (Q2172383) (← links)
- Erdős-Ko-Rado theorems for chordal graphs and trees (Q2431248) (← links)
- On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem (Q2849937) (← links)
- Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints (Q2947024) (← links)
- On cross-intersecting families of independent sets in graphs (Q3101013) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- (Q3635573) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- An Erd\H{o}s--Ko--Rado theorem for matchings in the complete graph (Q5420031) (← links)
- Chv\'atal's conjecture for downsets of small rank (Q6283784) (← links)
- On intersecting families of subgraphs of perfect matchings (Q6736850) (← links)
