Show simple item record

The non-existence of certain regular graphs of girth 5

dc.contributor.authorKovacs, Peteren_US
dc.date.accessioned2006-04-07T18:05:35Z
dc.date.available2006-04-07T18:05:35Z
dc.date.issued1981-06en_US
dc.identifier.citationKovacs, Peter (1981/06)."The non-existence of certain regular graphs of girth 5." Journal of Combinatorial Theory, Series B 30(3): 282-284. <http://hdl.handle.net/2027.42/24359>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6WHT-4D7K71F-BW/2/ac3d5225d690beff7187af48850fa707en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/24359
dc.description.abstractFor certain positive integers k it is shown that there is no k-regular graph with girth 5 having k2 + 3 vertices. This provides a new lower bound for the number of vertices of girth 5 graphs with these valences.en_US
dc.format.extent161196 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleThe non-existence of certain regular graphs of girth 5en_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, The University of Michigan, Ann Arbor, Michigan 48109, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/24359/1/0000628.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0095-8956(81)90045-9en_US
dc.identifier.sourceJournal of Combinatorial Theory, Series Ben_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.