Concepedia

Karen Meagher

KM

23

Publications

648

Citations

16

H-Index

2004

Active since

Affiliations

University of Regina(Current)

University of Ottawa

University of Waterloo

Carleton University

University of Milano-Bicocca

Karen Meagher is an author at University of Regina specializing in discrete mathematics, combinatorial optimization, and graph theory.

Top concepts

Discrete MathematicsCombinatorial OptimizationGraph TheoryEngineeringEducationComputational ComplexityGeometric Group TheoryComputer ScienceNetwork AnalysisRepresentation Theory

Publications per year

2004–2020

23

Publications

23

A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations

Chris Godsil, Karen Meagher · European Journal of Combinatorics · 2008 · 82 citations

Erdős–ko–rado Theorem, Bijective Combinatorics, Enumerative Combinatorics +2

Group construction of covering arrays

Karen Meagher, Brett Stevens · Journal of Combinatorial Designs · 2004 · 54 citations

Geometric Group Theory, Group Construction, G Symbols +9

On the metric dimension of Grassmann graphs

R. A. Bailey, Karen Meagher · Discrete Mathematics & Theoretical Computer Science · 2012 · 53 citations · Full text

Graph Minor, Schubert Calculus, Geometric Graph Theory +12

Covering arrays on graphs

Karen Meagher, Brett Stevens · Journal of Combinatorial Theory Series B · 2005 · 49 citations

Engineering, Graph Theory, Structural Graph Theory +7

Resolving sets for Johnson and Kneser graphs

R. A. Bailey, José Cáceres, Delia Garijo et al. · European Journal of Combinatorics · 2012 · 46 citations · Full text

Mathematical Programming, Kneser Graphs, Engineering +8

Rows per page

1–5 of 23