Karen Meagher

activity

20062026

most citedResolving sets for Johnson and Kneser graphs

49 citations · 78 across the 41 of their papers we have counts for

collaborators

Showing 2012 · math.COShow all

3 papers · 2 filters

math.CO2012

The exact bound for the Erdős-Ko-Rado theorem for $t$ -cycle-intersecting permutations

Karen Meagher, Alison Purdy

In this paper we adapt techniques used by Ahlswede and Khachatrian in their proof of the Complete Erdős-Ko-Rado Theorem to show that if $n \geq 2 t + 1$ , then any pairwise $t$ -cycle-i…

math.CO2012★ 49 cited

Resolving sets for Johnson and Kneser graphs

Robert F. Bailey, José Cáceres, Delia Garijo +4

A set of vertices $S$ in a graph $G$ is a {\em resolving set} for $G$ if, for any two vertices $u, v$ , there exists $x \in S$ such that the distances $d (u, x) \neq = d (v, x)$ . In this pa…

math.CO2012

Sperner partition systems

P. C. Li, Karen Meagher

A \textsl{Sperner $k$ -partition system} on a set $X$ is a set of partitions of $X$ into $k$ classes such that the classes of the partitions form a Sperner set system (so no class f…

The exact bound for the Erdős-Ko-Rado theorem for t-cycle-intersecting permutations

Resolving sets for Johnson and Kneser graphs

Sperner partition systems

The exact bound for the Erdős-Ko-Rado theorem for $t$ -cycle-intersecting permutations