Cameron's construction of two-graphs (Q1974542)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cameron's construction of two-graphs |
scientific article; zbMATH DE number 1439841
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cameron's construction of two-graphs |
scientific article; zbMATH DE number 1439841 |
Statements
Cameron's construction of two-graphs (English)
0 references
26 April 2001
0 references
A two-graph is a pair \((V,\Omega)\), where \(\Omega\) is a set of 3-element subsets of \(V\) with the property that each 4-element subset of \(V\) contains an even number of members of \(\Omega\). The paper discusses P. J. Cameron's construction of two-graphs, which was presented in [ibid. 127, No. 1-3, 63-74 (1994; Zbl 0802.05042)].
0 references
two-graph
0 references
0 references
0 references
0 references
0.85153043
0 references
0 references
0.84336543
0 references
