Show simple item record

On the number of unique subgraphs

dc.contributor.authorHarary, Franken_US
dc.contributor.authorSchwenk, Allen J.en_US
dc.date.accessioned2006-04-17T16:35:35Z
dc.date.available2006-04-17T16:35:35Z
dc.date.issued1973-10en_US
dc.identifier.citationHarary, Frank, Schwenk, Allen J. (1973/10)."On the number of unique subgraphs." Journal of Combinatorial Theory, Series B 15(2): 156-160. <http://hdl.handle.net/2027.42/33805>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6WHT-4D7BTVV-24/2/5cc76056fc6363a3ce2c1dedf11a8115en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/33805
dc.description.abstractEntringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lower bound for the maximum number of unique subgraphs in any n-point graph, which we now improve.en_US
dc.format.extent203936 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleOn the number of unique subgraphsen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumUniversity of Michigan, Ann Arbor, Michigan 48104, USAen_US
dc.contributor.affiliationumUniversity of Michigan, Ann Arbor, Michigan 48104, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/33805/1/0000060.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0095-8956(73)90015-4en_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 library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information 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.