IBM Journal of Research and Development
IBM Skip to main content
  Home     Products & services     Support & downloads     My account  

  Select a country  
Journals Home  
  Systems Journal  
Journal of Research
and Development
  ·  Current Issue  
  ·  Recent Issues  
  ·  Papers in Progress  
  ·  Search/Index  
  ·  Orders  
  ·  Description  
  ·  Patents  
  ·  Recent publications  
  ·  Author's Guide  
  Staff  
  Contact Us  
  Related links:  
     IBM Research  

IBM Journal of Research and Development  
Volume 4, Number 5, Page 487 (1960)
Combinatorial problems
  Full article: arrowPDF   arrowCopyright info





   

On the Exceptional Case in a Characterization of the Arcs of a Complete Graph

by A. J. Hoffman
It is known that a certain simple set of properties characterize the relationship of adjacency of the n(n − 1)/2 arcs of the complete graph of order n, when n ≠ 8, and that these properties are not a sufficient characterization when n = 8 (see [1], [2], [3], [4], and [7]). The present paper describes a method for enumerating all counter-examples when n = 8.
Related Subjects: Combinatorial problems; Graph theory; Mathematics