The combinatorics of Dom de Caen

DOI10.1007/s10623-004-4850-yzbMath1091.01015OpenAlexW2142369008WikidataQ56850774 ScholiaQ56850774MaRDI QIDQ1766102

van Dam, Edwin R.

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

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Biographies, obituaries, personalia, bibliographies (01A70) Extremal set theory (05D05) History of combinatorics (05-03)

Related Items (3)

Biregular graphs with three eigenvalues ⋮ Graphs with three eigenvalues and second largest eigenvalue at most 1 ⋮ Open problems in the spectral theory of signed graphs

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

This page was built for publication: The combinatorics of Dom de Caen