Klaus Metsch

According to our database, Klaus Metsch authored at least 60 papers between 1987 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

On the treewidth of generalized Kneser graphs.

Klaus Metsch

Australas. J Comb., 2023

2022

Erdős-Ko-Rado sets of flags of finite sets.

Klaus Metsch

J. Comb. Theory, Ser. A, 2022

An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings.

Jan De Beule, Sam Mattheus, Klaus Metsch

J. Comb. Theory, Ser. A, 2022

On the chromatic number of two generalized Kneser graphs.

Jozefien D'haeseleer, Klaus Metsch, Daniel Werner

Eur. J. Comb., 2022

2021

The Chromatic Number of Two Families of Generalized Kneser Graphs Related to Finite Generalized Quadrangles and Finite Projective 3-Spaces.

Klaus Metsch

Electron. J. Comb., 2021

2020

Perfect 2-Colorings of the Grassmann Graph of Planes.

Stefaan De Winter, Klaus Metsch

Electron. J. Comb., 2020

2019

On the smallest non-trivial tight sets in Hermitian polar spaces H(d, q2), d even.

Klaus Metsch, Daniel Werner

Discret. Math., 2019

Preface to the special issue on finite geometries.

Ilaria Cardinali, Michel Lavrauw, Klaus Metsch, Alexander Pott

Des. Codes Cryptogr., 2019

2018

Large {0, 1, ..., <i>t</i>}-cliques in dual polar graphs.

Ferdinand Ihringer, Klaus Metsch

J. Comb. Theory, Ser. A, 2018

2017

A gap result for Cameron-Liebler k-classes.

Klaus Metsch

Discret. Math., 2017

On the maximality of a set of mutually orthogonal Sudoku Latin Squares.

Jozefien D'haeseleer, Klaus Metsch, Leo Storme, Geertrui Van de Voorde

Des. Codes Cryptogr., 2017

On the Smallest Non-Trivial Tight Sets in Hermitian Polar Spaces.

Jan De Beule, Klaus Metsch

Electron. J. Comb., 2017

2016

A new family of tight sets in Q⁺(5, q).

Jan De Beule, Jeroen Demeyer, Klaus Metsch, Morgan Rodgers

Des. Codes Cryptogr., 2016

Small tight sets in finite elliptic, parabolic and Hermitian polar spaces.

Klaus Metsch

Comb., 2016

The characterization problem for designs with the parameters of AGd(n, q).

Dieter Jungnickel, Klaus Metsch

Comb., 2016

A note on Erdős-Ko-Rado sets of generators in Hermitian polar spaces.

Klaus Metsch

Adv. Math. Commun., 2016

2015

On weighted minihypers in finite projective spaces of square order.

Linda Beukemann, Klaus Metsch, Leo Storme

Adv. Math. Commun., 2015

2014

An improved bound on the existence of Cameron-Liebler line classes.

Klaus Metsch

J. Comb. Theory, Ser. A, 2014

A modular equality for Cameron-Liebler line classes.

Alexander L. Gavrilyuk, Klaus Metsch

J. Comb. Theory, Ser. A, 2014

On the maximum size of Erdős-Ko-Rado sets in $$H(2d+1, q^2)$$.

Ferdinand Ihringer, Klaus Metsch

Des. Codes Cryptogr., 2014

Remarks on polarity designs.

Dina Ghinelli, Dieter Jungnickel, Klaus Metsch

Des. Codes Cryptogr., 2014

2013

Sets of generators blocking all generators in finite classical polar spaces.

Jan De Beule, Anja Hallez, Klaus Metsch, Leo Storme

J. Comb. Theory, Ser. A, 2013

Small tight sets of hyperbolic quadrics.

Linda Beukemann, Klaus Metsch

Des. Codes Cryptogr., 2013

A Bound on Permutation Codes.

Jürgen Bierbrauer, Klaus Metsch

Electron. J. Comb., 2013

2011

A generalization of a result of Dembowski and Wagner.

Klaus Metsch

Des. Codes Cryptogr., 2011

2010

Small point sets of PG(<i>n</i>, <i>q</i>³) intersecting each <i>k</i>-subspace in 1 mod <i>q</i> points.

Nóra V. Harrach, Klaus Metsch

Des. Codes Cryptogr., 2010

2008

Partial ovoids and partial spreads in symplectic and orthogonal polar spaces.

Jan De Beule, Andreas Klein, Klaus Metsch, Leo Storme

Eur. J. Comb., 2008

Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound.

Jan De Beule, Klaus Metsch, Leo Storme

Des. Codes Cryptogr., 2008

Partial ovoids and partial spreads in hermitian polar spaces.

Jan De Beule, Andreas Klein, Klaus Metsch, Leo Storme

Des. Codes Cryptogr., 2008

Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound.

Jan De Beule, Klaus Metsch, Leo Storme

Adv. Math. Commun., 2008

2007

The maximum size of a partial spread in H(5, q²) is q³+1.

Jan De Beule, Klaus Metsch

J. Comb. Theory, Ser. A, 2007

Parameters for which the Griesmer bound is not sharp.

Andreas Klein, Klaus Metsch

Discret. Math., 2007

Characterization results on small blocking sets of the polar spaces <i>Q</i> ⁺(2 <i>n</i> + 1, 2) and <i>Q</i> ⁺(2 <i>n</i> + 1, 3).

Jan De Beule, Klaus Metsch, Leo Storme

Des. Codes Cryptogr., 2007

2005

Minimal blocking sets of size q²+2 of Q(4, q), q an odd prime, do not exist.

Jan De Beule, Klaus Metsch

Finite Fields Their Appl., 2005

The smallest point sets that meet all generators of <i>H</i>(2<i>n, q</i>²).

Jan De Beule, Klaus Metsch

Discret. Math., 2005

Blocking Structures of Hermitian Varieties.

Klaus Metsch

Des. Codes Cryptogr., 2005

2004

Small point sets that meet all generators of Q(2n, p), p>3 prime.

Jan De Beule, Klaus Metsch

J. Comb. Theory, Ser. A, 2004

Small Point Sets that Meet All Generators of W(2n+1, iq).

Klaus Metsch

Des. Codes Cryptogr., 2004

Blocking Subspaces By Lines In PG(n, q).

Klaus Metsch

Comb., 2004

2003

On the Characterization of the Folded Halved Cubes by Their Intersection Arrays.

Klaus Metsch

Des. Codes Cryptogr., 2003

2002

Partial linear complexes of PG(3, <i>q</i>).

Klaus Metsch, Leo Storme

Discret. Math., 2002

1999

On a Characterization of Bilinear Forms Graphs.

Klaus Metsch

Eur. J. Comb., 1999

Partial-Spreads in.

Klaus Metsch, Leo Storme

Des. Codes Cryptogr., 1999

A Bose-Burton Theorem for Elliptic Polar Spaces.

Klaus Metsch

Des. Codes Cryptogr., 1999

A Note on the Cycle Structures of Automorphisms of 2-(v, k, 1) Designs.

Klaus Metsch, Bridget S. Webb

Ars Comb., 1999

1997

Characterization of the Folded Johnson Graphs of Small Diameter by their Intersection Arrays.

Klaus Metsch

Eur. J. Comb., 1997

On the Characterization of the Folded Johnson Graphs and the Folded Halved Cubes by their Intersection Arrays.

Klaus Metsch

Eur. J. Comb., 1997

Embedding theorems for locally projective three-dimensional linear spaces.

Klaus Metsch

Discret. Math., 1997

Embedding the Linear Structure of Planar Spaces into Projective Spaces.

Klaus Metsch

Des. Codes Cryptogr., 1997

Blocking <i>s</i>-Dimensional Subspaces by Lines in <i>PG</i>(2<i>s, q</i>).

Jörg Eisfeld, Klaus Metsch

Comb., 1997

1995

A characterization of Grassmann graphs.

Klaus Metsch

Eur. J. Comb., 1995

Quasi-residual designs, 1 1/2-designs, and strongly regular multigraphs.

Klaus Metsch

Discret. Math., 1995

On the Number of Lines in Planar Spaces.

Klaus Metsch

Comb., 1995

1993

On the Size of a Maximal Partial Spread.

Aart Blokhuis, Klaus Metsch

Des. Codes Cryptogr., 1993

1992

Linear spaces withn² + n + 2lines.

Klaus Metsch

Eur. J. Comb., 1992

Linear spaces with few lines.

Klaus Metsch

Discret. Math., 1992

1991

Improvement of Bruck's Completion Theorem.

Klaus Metsch

Des. Codes Cryptogr., 1991

1989

Embedding finite planar spaces into 3-dimensional projective spaces.

Klaus Metsch

J. Comb. Theory, Ser. A, 1989

1988

An optimal bound for embedding linear spaces into projective planes.

Klaus Metsch

Discret. Math., 1988

1987

Embedding finite linear spaces in projective planes, II.

Albrecht Beutelspacher, Klaus Metsch

Discret. Math., 1987