Exponentially many perfect matchings in cubic graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10100269" target="_blank" >RIV/00216208:11320/11:10100269 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.aim.2011.03.015" target="_blank" >http://dx.doi.org/10.1016/j.aim.2011.03.015</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.aim.2011.03.015" target="_blank" >10.1016/j.aim.2011.03.015</a>
Alternative languages
Result language
angličtina
Original language name
Exponentially many perfect matchings in cubic graphs
Original language description
We prove a conjecture of Lovasz and Plummer that every cubic bridgeless graph contains an exponential number of perfect matchings.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Advances in Mathematics
ISSN
0001-8708
e-ISSN
—
Volume of the periodical
2011
Issue of the periodical within the volume
227
Country of publishing house
US - UNITED STATES
Number of pages
19
Pages from-to
1646-1664
UT code for WoS article
000291174600011
EID of the result in the Scopus database
—