The combinatorics of Dom de Caen
From MaRDI portal
Publication:1766102
DOI10.1007/s10623-004-4850-yzbMath1091.01015WikidataQ56850774 ScholiaQ56850774MaRDI QIDQ1766102
Publication date: 28 February 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/3b0c4635-bbfa-4dab-b4e5-383fb3665ab9
05B05: Combinatorial aspects of block designs
05E30: Association schemes, strongly regular graphs
01A70: Biographies, obituaries, personalia, bibliographies
05D05: Extremal set theory
05-03: History of combinatorics
Related Items
Cites Work
- Unnamed Item
- An upper bound for the Turán number \(t_3(n,4)\)
- A Cauchy-Khinchin matrix inequality
- Codes, graphs, and schemes from nonlinear functions
- A lower bound on the probability of a finite union of events
- A lower bound on the error probability for signals in white Gaussian noise
- Research problems
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph