uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
PERFECT MATCHINGS IN RANDOM S-UNIFORM HYPERGRAPHS
Uppsala University.
Uppsala University.
1995 (English)In: RANDOM STRUCTURES & ALGORITHMS, Vol. 7, no 1, 41-57 p.Article in journal (Other scientific) Published
Abstract [en]

Let E={X(1),X(2),...,X(m)} where the X(i) subset of or equal to V for 1 less than or equal to i less than or equal to m are distinct. The hypergraph G=(V,E) is said to be s-uniform if \X(1)\=s for 1 less than or equal to i less than or equal to m. A set o

Place, publisher, year, edition, pages
JOHN WILEY & SONS LTD , 1995. Vol. 7, no 1, 41-57 p.
Identifiers
URN: urn:nbn:se:uu:diva-27033OAI: oai:DiVA.org:uu-27033DiVA: diva2:54927
Note
Addresses: FRIEZE A, CARNEGIE MELLON UNIV, DEPT MATH, PITTSBURGH, PA 15213. UNIV UPPSALA, DEPT MATH, S-75106 UPPSALA, SWEDEN.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-16

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 380 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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