Advertisement

A problem on bichrome 6-graphs

Part 0 Summaries ofthe expositional essays
  • 129 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 445)

Abstract

2 A problem on bichrome 6-graphs This chapter's main purpose is to show the streamlining of a combinatorial argument full of nested case analyses. The decision to maintain all symmetries is the major means to that end: the consequential avoidance of nomenclature strongly invites the use of a counting argument rather than a combinatorial one, and, like in “A termination argument”, the “invention” of a concept in terms of which the argument is most smoothly formulated.

Keywords

Complete Graph Coloured Graph Counting Argument Individual Colour Blue Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Personalised recommendations