Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

book chapter · 1997

Enumeration

Ronald C. Read

Cited by 2Abstract and details only

Abstract

Abstract In this chapter we present the basic problem of graphical enumeration-the enumeration of unlabelled graphs. In particular, we look at Pólya‘s Enumeration Theorem and some problems to which it can be applied. We then consider the enumeration of some other kinds of graphs. The chapter concludes with some remarks about unsolved problems of graphical enumeration. How many graphs are there on four vertices? This question can easily be resolved by a process of trial and error, but if we ask how many graphs there are on ten vertices, the answer can be reliably found only by theoretical means, while the similar question for an indefinite number of vertices clearly requires a formula of some kind. In this chapter we shall be largely concerned with deriving such a formula, and some similar results.

Cite this paper

APA 7

Read, R. C. (1997). Enumeration. https://doi.org/10.1093/oso/9780198514978.003.0002

MLA 9

Read, Ronald C. “Enumeration.” 1997, pp. 13–33, https://doi.org/10.1093/oso/9780198514978.003.0002.

Chicago

Read, Ronald C. 1997. “Enumeration.” https://doi.org/10.1093/oso/9780198514978.003.0002.

Harvard

Read, R.C. (1997) ‘Enumeration’. Available at: https://doi.org/10.1093/oso/9780198514978.003.0002.

BibTeX
@incollection{read1997enumeration,
  title = {{Enumeration}},
  author = {Read, Ronald C.},
  pages = {13--33},
  year = {1997},
  doi = {10.1093/oso/9780198514978.003.0002}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers