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
On the number of nearly perfect matchings in almost regular uniform hypergraphs
Luleå University of Technology.
Institute of System Programming, Russian Academy of Sciences.
2002 (English)In: Paul Erdos and his mathematics / [ed] Gábor Halász, Berlin: János Bolyai Mathematical Society , 2002Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Berlin: János Bolyai Mathematical Society , 2002.
Series
Bolyai Society Mathematical Studies, ISSN 1217-4696 ; 1-2
National Category
Mathematical Analysis
Research subject
Mathematics
Identifiers
URN: urn:nbn:se:ltu:diva-37071Local ID: af443bd0-9bd8-11df-a707-000ea68e967bISBN: 9638022965 (print)OAI: oai:DiVA.org:ltu-37071DiVA, id: diva2:1010569
Conference
Paul Erdos and his mathematics (Conference) : 04/07/1999 - 11/07/1999
Note

Godkänd; 2002; 20100730 (andbra)

Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2021-02-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Search in DiVA

By author/editor
Asratian, Armen S
By organisation
Luleå University of Technology
Mathematical Analysis

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 51 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