A problem on bichrome 6-graphs
- 129 Downloads
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.
KeywordsComplete Graph Coloured Graph Counting Argument Individual Colour Blue Edge
Unable to display preview. Download preview PDF.