A new lower bound on the number of 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%2F09%3A10030348" target="_blank" >RIV/00216208:11320/09:10030348 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A new lower bound on the number of perfect matchings in cubic graphs
Original language description
We prove the first lower bound on the number of perfect matchings of cubic bridgeless graphs not based on the dimension of the perfect matchings polytope.
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
Result was created during the realization of more than one project. More information in the Projects tab.
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
2009
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
SIAM Journal on Discrete Mathematics
ISSN
0895-4801
e-ISSN
—
Volume of the periodical
23
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
19
Pages from-to
—
UT code for WoS article
000277834200002
EID of the result in the Scopus database
—