Abstract
The determination of the possible numbers of triples in a maximal partial triple system of order λ begun by Severn is completed. The result rests on the characterization of the maximum number of edges in a triangle-free, nonbipartite, antieulerian graph on n vertices.
Original language | English (US) |
---|---|
Pages (from-to) | 209-219 |
Number of pages | 11 |
Journal | Designs, Codes and Cryptography |
Volume | 3 |
Issue number | 3 |
DOIs | |
State | Published - Jul 1 1993 |
Externally published | Yes |
Keywords
- packing by triples
- partial triple system
- triangle-free graph
ASJC Scopus subject areas
- Computer Science Applications
- Applied Mathematics