Skip to main content

Burnside’s Lemma

  • Chapter
  • First Online:
Combinatorics

Part of the book series: Problem Books in Mathematics ((PBM))

  • 3956 Accesses

Abstract

The simple problem of coloring fields of a square 2 × 2 using three colors is considered in Example 2.7.11, and the number of nonequivalent colorings is determined by direct counting. At the beginning of this section we shall formulate two more similar problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 69.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Mladenović, P. (2019). Burnside’s Lemma. In: Combinatorics. Problem Books in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-030-00831-4_7

Download citation

Publish with us

Policies and ethics