| Publication | Date of Publication | Type |
|---|
Cameron-Liebler sets in permutation groups
Algebraic Combinatorics | 2024-10-07 | Paper |
The \(q\)-analogue of zero forcing for certain families of graphs
Discrete Applied Mathematics | 2024-03-27 | Paper |
On the intersection density of the Kneser graph \(K(n, 3)\)
European Journal of Combinatorics | 2024-03-26 | Paper |
Induced forests in some distance-regular graphs
Discrete Applied Mathematics | 2024-02-14 | Paper |
On the structure of small strength‐2 covering arrays
Journal of Combinatorial Designs | 2024-01-29 | Paper |
Cameron-Liebler sets in permutation groups
| 2023-08-16 | Paper |
An extension of the Erdős-Ko-Rado theorem to uniform set partitions
Ars Mathematica Contemporanea | 2023-05-31 | Paper |
Some Erdös-Ko-Rado results for linear and affine groups of degree two
The Art of Discrete and Applied Mathematics | 2022-12-19 | Paper |
Fusions of the generalized Hamming scheme on a strongly-regular graph
Graphs and Combinatorics | 2022-09-12 | Paper |
The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
The Electronic Journal of Combinatorics | 2021-10-26 | Paper |
Erd\H{o}s-Ko-Rado results for the general linear group, the special linear group and the affine general linear group
| 2021-10-17 | Paper |
The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings
Algebraic Combinatorics | 2021-10-04 | Paper |
Erdős-Ko-Rado theorems on the weak Bruhat lattice
Discrete Applied Mathematics | 2021-05-19 | Paper |
On triangles in derangement graphs
Journal of Combinatorial Theory. Series A | 2021-02-22 | Paper |
Weakly Hadamard diagonalizable graphs
Linear Algebra and its Applications | 2021-02-16 | Paper |
Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Special Matrices | 2021-01-14 | Paper |
All 2-transitive groups have the EKR-module property
Journal of Combinatorial Theory. Series A | 2020-10-07 | Paper |
2-intersecting permutations
| 2020-04-30 | Paper |
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Special Matrices | 2020-02-26 | Paper |
Correction to: ``Miklós-Manickam-Singhi conjectures on partial geometries
Designs, Codes and Cryptography | 2019-05-24 | Paper |
Positive zero forcing and edge clique coverings
Frontiers in Algorithmics | 2019-04-26 | Paper |
An Erdős-Ko-Rado theorem for the group \(\mathrm{PSU}(3, q)\)
Designs, Codes and Cryptography | 2019-03-18 | Paper |
Brushing number and zero-forcing number of graphs and their line graphs
Graphs and Combinatorics | 2019-01-11 | Paper |
Ovoids of generalized quadrangles of order and Delsarte cocliques in related strongly regular graphs
Journal of Combinatorial Designs | 2018-10-05 | Paper |
Compressed cliques graphs, clique coverings and positive zero forcing
Theoretical Computer Science | 2018-06-05 | Paper |
Miklós-Manickam-Singhi conjectures on partial geometries
Designs, Codes and Cryptography | 2018-05-24 | Paper |
Infection in hypergraphs
Discrete Applied Mathematics | 2018-02-22 | Paper |
An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
Ars Mathematica Contemporanea | 2017-09-14 | Paper |
The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
Journal of Algebraic Combinatorics | 2016-06-13 | Paper |
An Erdős-Ko-Rado theorem for finite 2-transitive groups
European Journal of Combinatorics | 2016-04-14 | Paper |
On the complexity of the positive semidefinite zero forcing number
Linear Algebra and its Applications | 2016-02-12 | Paper |
Intersection theorems for multisets
European Journal of Combinatorics | 2015-12-11 | Paper |
Erdős-Ko-Rado theorems. Algebraic approaches
| 2015-11-20 | Paper |
The Erdős-Ko-Rado property for some 2-transitive groups
Annals of Combinatorics | 2015-11-18 | Paper |
The complexity of the positive semidefinite zero forcing
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
An Erdős-Ko-Rado theorem for subset partitions
Involve | 2015-04-16 | Paper |
Graphs that have a weighted adjacency matrix with spectrum $\{\lambda_1^{n-2}, \lambda_1^2\}$
| 2015-04-16 | Paper |
The Erdős-Ko-Rado property for some permutation groups
| 2015-04-09 | Paper |
Intersecting generalised permutations
| 2015-04-09 | Paper |
An Erdős-Ko-Rado theorem for the derangement graph of \(\mathrm{PGL}_3(q)\) acting on the projective plane
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
On the relationships between zero forcing numbers and certain graph coverings
Special Matrices | 2014-06-25 | Paper |
On the metric dimension of Grassmann graphs
| 2014-05-06 | Paper |
A new proof for the Erdős-Ko-Rado theorem for the alternating group
Discrete Mathematics | 2014-03-20 | Paper |
Minimum number of distinct eigenvalues of graphs
The Electronic Journal of Linear Algebra | 2014-02-10 | Paper |
Sperner partition systems
Journal of Combinatorial Designs | 2013-08-13 | Paper |
Resolving sets for Johnson and Kneser graphs
European Journal of Combinatorics | 2013-03-06 | Paper |
The minimum rank of universal adjacency matrices
Linear Algebra and its Applications | 2012-09-06 | Paper |
The exact bound for the Erd\H{o}s-Ko-Rado theorem for $t$-cycle-intersecting permutations
| 2012-08-17 | Paper |
An Erdős-Ko-Rado theorem for multisets
The Electronic Journal of Combinatorics | 2012-03-06 | Paper |
Multiplicity-free permutation representations of the symmetric group.
Annals of Combinatorics | 2012-01-24 | Paper |
Generalized covering designs and clique coverings
Journal of Combinatorial Designs | 2011-11-21 | Paper |
An Erdős-Ko-Rado theorem for the derangement graph of PGL(\(2,q\)) acting on the projective line
Journal of Combinatorial Theory. Series A | 2011-01-14 | Paper |
The Erdos-Ko-Rado theorem for perfect matchings
| 2009-11-18 | Paper |
A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
European Journal of Combinatorics | 2009-03-04 | Paper |
Mixed covering arrays on graphs
Journal of Combinatorial Designs | 2008-01-07 | Paper |
Covering arrays on graphs: qualitative independence graphs and extremal set partition theory
| 2007-01-19 | Paper |
Erdős-Ko-Rado theorems for uniform set-partition systems
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
A Sperner-type theorem for set-partition systems
The Electronic Journal of Combinatorics | 2005-11-01 | Paper |
Covering arrays on graphs
Journal of Combinatorial Theory. Series B | 2005-09-28 | Paper |
Group construction of covering arrays
Journal of Combinatorial Designs | 2005-02-23 | Paper |
