A lower bound for the number of orientable triangular embeddings of some complete graphs

Grannell, M. J. and Knor, M. (2010). A lower bound for the number of orientable triangular embeddings of some complete graphs. Journal of Combinatorial Theory, Series B, 100(2), pp. 216–225.

(Click here to request a copy from the OU Author.)

DOI (Digital Object Identifier) Link:	http://dx.doi.org/doi:10.1016/j.jctb.2009.08.001
Google Scholar:	Look up in Google Scholar

Abstract

We prove that, for a certain positive constant a and for an infinite set of values of n, the number of nonisomorphic face 2-colourable triangular embeddings of the complete graph K_n in an orientable surface is at least n^an2.

Item Type:	Journal Article
ISSN:	0095-8956
Keywords:	Steiner triple system; Latin square; Complete graph; Triangular embedding
Academic Unit/Department:	Mathematics, Computing and Technology > Mathematics and Statistics
Item ID:	21315
Depositing User:	Colin Smith
Date Deposited:	13 May 2010 10:14
Last Modified:	30 Nov 2012 10:37
URI:	http://oro.open.ac.uk/id/eprint/21315

Actions (login may be required)

	View Item
RDF+XMLBibTeXRDF+N-TriplesJSONDublin CoreAtomOAI-ORE Resource Map (Atom Format)Simple MetadataReferMETSOAI-ORE Resource Map (RDF Format)HTML CitationASCII CitationMultiline CSVRefMan RIS Format (UTF-8)OpenURL ContextObjectEndNoteMODSOpenURL ContextObject in SpanMPEG-21 DIDLEP3 XMLRefMan RIS FormatRDF+N3Eprints Application Profile	Public: Report issue / request change