umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Uncountable families of vertex-transitive graphs of finite degree
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2006 (English)In: Discrete Mathematics, Vol. 306, no 7, 678-679 p.Article in journal (Refereed) Published
Abstract [en]

Recently the following question was relayed to the second author: What is the cardinality of the set of vertex transitive graphs of finite degree? Our aim in this short note is to show that there are $2^{\aleph_{0}}$ such graphs.

Place, publisher, year, edition, pages
2006. Vol. 306, no 7, 678-679 p.
Keyword [en]
Vertex transitive graphs, Cayley graphs, Infinite graphs
National Category
Discrete Mathematics
Research subject
Mathematics
Identifiers
URN: urn:nbn:se:umu:diva-7599DOI: 10.1016/J.Disc.2006.01.021ISI: 000236949400006OAI: oai:DiVA.org:umu-7599DiVA: diva2:147270
Available from: 2008-01-11 Created: 2008-01-11 Last updated: 2012-06-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Markström, Klas

Search in DiVA

By author/editor
Markström, Klas
By organisation
Department of Mathematics and Mathematical Statistics
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 33 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf