default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Metsch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j61]Ilaria Cardinali, Michel Lavrauw, Klaus Metsch, Alexander Pott:
Finite geometries. Des. Codes Cryptogr. 93(2): 265-266 (2025)- 2023
- [j60]Klaus Metsch:
On the treewidth of generalized Kneser graphs. Australas. J Comb. 86: 477-486 (2023) - 2022
- [j59]Jozefien D'haeseleer, Klaus Metsch, Daniel Werner:
On the chromatic number of two generalized Kneser graphs. Eur. J. Comb. 101: 103474 (2022) - [j58]Klaus Metsch
:
Erdős-Ko-Rado sets of flags of finite sets. J. Comb. Theory A 191: 105641 (2022) - [j57]Jan De Beule, Sam Mattheus, Klaus Metsch:
An algebraic approach to Erdős-Ko-Rado sets of flags in spherical buildings. J. Comb. Theory A 192: 105657 (2022) - 2021
- [j56]Klaus Metsch:
The Chromatic Number of Two Families of Generalized Kneser Graphs Related to Finite Generalized Quadrangles and Finite Projective 3-Spaces. Electron. J. Comb. 28(3): 3 (2021) - 2020
- [j55]Stefaan De Winter, Klaus Metsch:
Perfect 2-Colorings of the Grassmann Graph of Planes. Electron. J. Comb. 27(1): 1 (2020)
2010 – 2019
- 2019
- [j54]Ilaria Cardinali, Michel Lavrauw, Klaus Metsch, Alexander Pott:
Preface to the special issue on finite geometries. Des. Codes Cryptogr. 87(4): 715-716 (2019) - [j53]Klaus Metsch, Daniel Werner:
On the smallest non-trivial tight sets in Hermitian polar spaces H(d, q2), d even. Discret. Math. 342(5): 1336-1342 (2019) - 2018
- [j52]Ferdinand Ihringer, Klaus Metsch:
Large {0, 1, ..., t}-cliques in dual polar graphs. J. Comb. Theory A 154: 285-322 (2018) - 2017
- [j51]Jan De Beule, Klaus Metsch:
On the Smallest Non-Trivial Tight Sets in Hermitian Polar Spaces. Electron. J. Comb. 24(1): 1 (2017) - [j50]Jozefien D'haeseleer, Klaus Metsch, Leo Storme, Geertrui Van de Voorde:
On the maximality of a set of mutually orthogonal Sudoku Latin Squares. Des. Codes Cryptogr. 84(1-2): 143-152 (2017) - [j49]Klaus Metsch:
A gap result for Cameron-Liebler k-classes. Discret. Math. 340(6): 1311-1318 (2017) - 2016
- [j48]Klaus Metsch:
A note on Erdős-Ko-Rado sets of generators in Hermitian polar spaces. Adv. Math. Commun. 10(3): 541-545 (2016) - [j47]Dieter Jungnickel, Klaus Metsch:
The characterization problem for designs with the parameters of AGd(n, q). Comb. 36(5): 513-535 (2016) - [j46]Klaus Metsch:
Small tight sets in finite elliptic, parabolic and Hermitian polar spaces. Comb. 36(6): 725-744 (2016) - [j45]Jan De Beule, Jeroen Demeyer, Klaus Metsch, Morgan Rodgers:
A new family of tight sets in Q+(5, q). Des. Codes Cryptogr. 78(3): 655-678 (2016) - 2015
- [j44]Linda Beukemann, Klaus Metsch, Leo Storme:
On weighted minihypers in finite projective spaces of square order. Adv. Math. Commun. 9(3): 291-309 (2015) - 2014
- [j43]Dina Ghinelli, Dieter Jungnickel, Klaus Metsch:
Remarks on polarity designs. Des. Codes Cryptogr. 72(1): 7-19 (2014) - [j42]Ferdinand Ihringer, Klaus Metsch:
On the maximum size of Erdős-Ko-Rado sets in $$H(2d+1, q^2)$$. Des. Codes Cryptogr. 72(2): 311-316 (2014) - [j41]Klaus Metsch:
An improved bound on the existence of Cameron-Liebler line classes. J. Comb. Theory A 121: 89-93 (2014) - [j40]Alexander L. Gavrilyuk, Klaus Metsch:
A modular equality for Cameron-Liebler line classes. J. Comb. Theory A 127: 224-242 (2014) - 2013
- [j39]Jürgen Bierbrauer, Klaus Metsch:
A Bound on Permutation Codes. Electron. J. Comb. 20(3): 6 (2013) - [j38]Linda Beukemann, Klaus Metsch:
Small tight sets of hyperbolic quadrics. Des. Codes Cryptogr. 68(1-3): 11-24 (2013) - [j37]Jan De Beule, Anja Hallez, Klaus Metsch, Leo Storme:
Sets of generators blocking all generators in finite classical polar spaces. J. Comb. Theory A 120(2): 318-339 (2013) - 2011
- [j36]Klaus Metsch:
A generalization of a result of Dembowski and Wagner. Des. Codes Cryptogr. 60(3): 277-282 (2011) - 2010
- [j35]Nóra V. Harrach, Klaus Metsch:
Small point sets of PG(n, q3) intersecting each k-subspace in 1 mod q points. Des. Codes Cryptogr. 56(2-3): 235-248 (2010)
2000 – 2009
- 2008
- [j34]Jan De Beule, Klaus Metsch, Leo Storme:
Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound. Adv. Math. Commun. 2(3): 261-272 (2008) - [j33]Jan De Beule, Andreas Klein, Klaus Metsch, Leo Storme:
Partial ovoids and partial spreads in hermitian polar spaces. Des. Codes Cryptogr. 47(1-3): 21-34 (2008) - [j32]Jan De Beule, Klaus Metsch, Leo Storme:
Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound. Des. Codes Cryptogr. 49(1-3): 187-197 (2008) - [j31]Jan De Beule, Andreas Klein, Klaus Metsch, Leo Storme:
Partial ovoids and partial spreads in symplectic and orthogonal polar spaces. Eur. J. Comb. 29(5): 1280-1297 (2008) - 2007
- [j30]Jan De Beule, Klaus Metsch, Leo Storme:
Characterization results on small blocking sets of the polar spaces Q +(2 n + 1, 2) and Q +(2 n + 1, 3). Des. Codes Cryptogr. 44(1-3): 197-207 (2007) - [j29]Andreas Klein, Klaus Metsch:
Parameters for which the Griesmer bound is not sharp. Discret. Math. 307(22): 2695-2703 (2007) - [j28]Jan De Beule, Klaus Metsch:
The maximum size of a partial spread in H(5, q2) is q3+1. J. Comb. Theory A 114(4): 761-768 (2007) - 2005
- [j27]Klaus Metsch:
Blocking Structures of Hermitian Varieties. Des. Codes Cryptogr. 34(2-3): 339-360 (2005) - [j26]Jan De Beule, Klaus Metsch:
The smallest point sets that meet all generators of H(2n, q2). Discret. Math. 294(1-2): 75-81 (2005) - [j25]Jan De Beule, Klaus Metsch:
Minimal blocking sets of size q2+2 of Q(4, q), q an odd prime, do not exist. Finite Fields Their Appl. 11(2): 305-315 (2005) - 2004
- [j24]Klaus Metsch:
Blocking Subspaces By Lines In PG(n, q). Comb. 24(3): 459-486 (2004) - [j23]Klaus Metsch:
Small Point Sets that Meet All Generators of W(2n+1, iq). Des. Codes Cryptogr. 31(3): 283-288 (2004) - [j22]Jan De Beule, Klaus Metsch:
Small point sets that meet all generators of Q(2n, p), p>3 prime. J. Comb. Theory A 106(2): 327-333 (2004) - 2003
- [j21]Klaus Metsch:
On the Characterization of the Folded Halved Cubes by Their Intersection Arrays. Des. Codes Cryptogr. 29(1-3): 215-225 (2003) - 2002
- [j20]Klaus Metsch, Leo Storme:
Partial linear complexes of PG(3, q). Discret. Math. 255(1-3): 287-296 (2002)
1990 – 1999
- 1999
- [j19]Klaus Metsch, Bridget S. Webb:
A Note on the Cycle Structures of Automorphisms of 2-(v, k, 1) Designs. Ars Comb. 51 (1999) - [j18]Klaus Metsch:
A Bose-Burton Theorem for Elliptic Polar Spaces. Des. Codes Cryptogr. 17(1-3): 219-224 (1999) - [j17]Klaus Metsch, Leo Storme:
Partial-Spreads in. Des. Codes Cryptogr. 18(1/3): 199-216 (1999) - [j16]Klaus Metsch:
On a Characterization of Bilinear Forms Graphs. Eur. J. Comb. 20(4): 293-306 (1999) - 1997
- [j15]Jörg Eisfeld, Klaus Metsch:
Blocking s-Dimensional Subspaces by Lines in PG(2s, q). Comb. 17(2): 151-162 (1997) - [j14]Klaus Metsch:
Embedding the Linear Structure of Planar Spaces into Projective Spaces. Des. Codes Cryptogr. 10(2): 251-263 (1997) - [j13]Klaus Metsch:
Embedding theorems for locally projective three-dimensional linear spaces. Discret. Math. 174(1-3): 227-245 (1997) - [j12]Klaus Metsch:
On the Characterization of the Folded Johnson Graphs and the Folded Halved Cubes by their Intersection Arrays. Eur. J. Comb. 18(1): 65-74 (1997) - [j11]Klaus Metsch:
Characterization of the Folded Johnson Graphs of Small Diameter by their Intersection Arrays. Eur. J. Comb. 18(8): 901-913 (1997) - 1995
- [j10]Klaus Metsch:
On the Number of Lines in Planar Spaces. Comb. 15(1): 105-110 (1995) - [j9]Klaus Metsch:
Quasi-residual designs, 1 1/2-designs, and strongly regular multigraphs. Discret. Math. 143(1-3): 167-188 (1995) - [j8]Klaus Metsch:
A characterization of Grassmann graphs. Eur. J. Comb. 16(6): 639-644 (1995) - 1993
- [j7]Aart Blokhuis, Klaus Metsch:
On the Size of a Maximal Partial Spread. Des. Codes Cryptogr. 3(3): 187-191 (1993) - 1992
- [j6]Klaus Metsch:
Linear spaces with few lines. Discret. Math. 110(1-3): 215-222 (1992) - [j5]Klaus Metsch:
Linear spaces withn2 + n + 2lines. Eur. J. Comb. 13(6): 503-513 (1992) - 1991
- [j4]Klaus Metsch:
Improvement of Bruck's Completion Theorem. Des. Codes Cryptogr. 1(2): 99-116 (1991)
1980 – 1989
- 1989
- [j3]Klaus Metsch:
Embedding finite planar spaces into 3-dimensional projective spaces. J. Comb. Theory A 51(2): 161-168 (1989) - 1988
- [j2]Klaus Metsch:
An optimal bound for embedding linear spaces into projective planes. Discret. Math. 70(1): 53-70 (1988) - 1987
- [j1]Albrecht Beutelspacher, Klaus Metsch:
Embedding finite linear spaces in projective planes, II. Discret. Math. 66(3): 219-230 (1987)
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-03-05 21:56 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:
