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.
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1990). A problem on bichrome 6-graphs. In: On the Shape of Mathematical Arguments. Lecture Notes in Computer Science, vol 445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020911
Download citation
DOI: https://doi.org/10.1007/BFb0020911
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52849-4
Online ISBN: 978-3-540-47166-0
eBook Packages: Springer Book Archive