Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs (Q2202769)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs |
scientific article |
Statements
Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs (English)
0 references
30 September 2020
0 references
perfect coloring
0 references
transversals of hypergraph
0 references
combinatorial designs
0 references
\(q\)-analogs of combinatorial designs
0 references
difference sets
0 references
bent functions
0 references
Johnson graph
0 references
Grassmann graph
0 references
Delsarte-Hoffman bound
0 references
