default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaren Meagher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Karen Gunderson, Karen Meagher, Joy Morris, Venkata Raghu Tej Pantangi:
Induced forests in some distance-regular graphs. Discret. Appl. Math. 346: 290-300 (2024)- [j31]Shaun M. Fallat
, Neha Joshi, Roghayeh Maleki, Karen Meagher, Seyed Ahmad Mojallal, Shahla Nasserasr, Mahsa N. Shirazi, Andriaherimanana Sarobidy Razafimahatratra, Brett Stevens:
The q-analogue of zero forcing for certain families of graphs. Discret. Appl. Math. 348: 91-104 (2024) - [j30]Karen Meagher, Andriaherimanana Sarobidy Razafimahatratra:
On the intersection density of the Kneser graph K(n,3). Eur. J. Comb. 118: 103910 (2024) - 2023
- [j29]Karen Meagher, Mahsa N. Shirazi, Brett Stevens:
An extension of the Erdős-Ko-Rado theorem to uniform set partitions. Ars Math. Contemp. 23(4) (2023) - 2022
- [j28]Karen Meagher, Andriaherimanana Sarobidy Razafimahatratra:
Some Erdös-Ko-Rado results for linear and affine groups of degree two. Art Discret. Appl. Math. 6(1): 1 (2022) - [j27]Joseph S. Alameda, Franklin Kenter, Karen Meagher, Michael Young:
An upper bound for the k-power domination number in r-uniform hypergraphs. Discret. Math. 345(11): 113038 (2022) - [j26]Allen Herman, Neha Joshi, Karen Meagher:
Fusions of the generalized Hamming scheme on a strongly-regular graph. Graphs Comb. 38(5): 150 (2022) - 2021
- [j25]Karen Meagher, Andriaherimanana Sarobidy Razafimahatratra:
The Erdős-Ko-Rado Theorem for 2-Pointwise and 2-Setwise Intersecting Permutations. Electron. J. Comb. 28(4) (2021) - [j24]Karen Meagher, Peter Sin:
All 2-transitive groups have the EKR-module property. J. Comb. Theory A 177: 105322 (2021) - [j23]Karen Meagher, Andriaherimanana Sarobidy Razafimahatratra, Pablo Spiga:
On triangles in derangement graphs. J. Comb. Theory A 180: 105390 (2021)
2010 – 2019
- 2019
- [j22]Susanna Fishel, Glenn Hurlbert, Vikram Kamat, Karen Meagher:
Erdős-Ko-Rado theorems on the weak Bruhat lattice. Discret. Appl. Math. 266: 65-75 (2019) - [j21]Karen Meagher:
An Erdős-Ko-Rado theorem for the group $$\hbox {PSU}(3, q)$$ PSU ( 3 , q ). Des. Codes Cryptogr. 87(4): 717-744 (2019) - [j20]Ferdinand Ihringer, Karen Meagher:
Correction to: Miklós-Manickam-Singhi conjectures on partial geometries. Des. Codes Cryptogr. 87(6): 1457 (2019) - 2018
- [j19]Ryan Bergen, Shaun M. Fallat, Adam Gorr, Ferdinand Ihringer, Karen Meagher, Alison Purdy, Boting Yang, Guanglong Yu:
Infection in hypergraphs. Discret. Appl. Math. 237: 43-56 (2018) - [j18]Ferdinand Ihringer, Karen Meagher:
Miklós-Manickam-Singhi conjectures on partial geometries. Des. Codes Cryptogr. 86(6): 1311-1327 (2018) - [j17]Aras Erzurumluoglu, Karen Meagher, David A. Pike:
Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs. Graphs Comb. 34(6): 1279-1294 (2018) - [j16]Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang:
Compressed cliques graphs, clique coverings and positive zero forcing. Theor. Comput. Sci. 734: 119-130 (2018) - 2017
- [j15]Chris D. Godsil, Karen Meagher:
An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings. Ars Math. Contemp. 12(2): 205-217 (2017) - 2016
- [j14]Karen Meagher, Alison Purdy:
Intersection theorems for multisets. Eur. J. Comb. 52: 120-135 (2016) - [j13]Karen Meagher, Pablo Spiga, Pham Huu Tiep:
An Erdős-Ko-Rado theorem for finite 2-transitive groups. Eur. J. Comb. 55: 100-118 (2016) - [c2]Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang:
Positive Zero Forcing and Edge Clique Coverings. FAW 2016: 53-64 - 2015
- [j12]Bahman Ahmadi, Karen Meagher:
The Erdős-Ko-Rado property for some permutation groups. Australas. J Comb. 61: 23-41 (2015) - [j11]Peter Borg, Karen Meagher:
Intersecting generalised permutations. Australas. J Comb. 61: 147-155 (2015) - 2014
- [j10]Bahman Ahmadi, Karen Meagher:
A new proof for the Erdős-Ko-Rado theorem for the alternating group. Discret. Math. 324: 28-40 (2014) - [j9]Karen Meagher, Pablo Spiga:
An Erdös-Ko-Rado Theorem for the Derangement Graph of PGL3(q) Acting on the Projective Plane. SIAM J. Discret. Math. 28(2): 918-941 (2014) - [c1]Shaun M. Fallat, Karen Meagher, Boting Yang:
The Complexity of the Positive Semidefinite Zero Forcing. COCOA 2014: 681-693 - 2013
- [j8]Robert F. Bailey, José Cáceres, Delia Garijo, Antonio González Herrera, Alberto Márquez, Karen Meagher, María Luz Puertas:
Resolving sets for Johnson and Kneser graphs. Eur. J. Comb. 34(4): 736-751 (2013) - 2011
- [j7]Karen Meagher, Alison Purdy:
An Erdös-Ko-Rado Theorem for Multisets. Electron. J. Comb. 18(1) (2011) - [j6]Robert F. Bailey, Karen Meagher:
On the metric dimension of Grassmann graphs. Discret. Math. Theor. Comput. Sci. 13(4): 97-104 (2011) - [j5]Karen Meagher, Pablo Spiga:
An Erdos-Ko-Rado theorem for the derangement graph of PGL(2, q) acting on the projective line. J. Comb. Theory A 118(2): 532-544 (2011)
2000 – 2009
- 2009
- [j4]Chris D. Godsil, Karen Meagher:
A new proof of the Erdös-Ko-Rado theorem for intersecting families of permutations. Eur. J. Comb. 30(2): 404-414 (2009) - 2005
- [j3]Karen Meagher, Lucia Moura:
Erdos-Ko-Rado theorems for uniform set-partition systems. Electron. J. Comb. 12 (2005) - [j2]Karen Meagher, Lucia Moura, Brett Stevens:
A Sperner-Type Theorem for Set-Partition Systems. Electron. J. Comb. 12 (2005) - [j1]Karen Meagher, Brett Stevens:
Covering arrays on graphs. J. Comb. Theory B 95(1): 134-151 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
