A COMBINATORIAL PROOF OF RAYLEIGH MONOTONICITY FOR GRAPHS
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10283341" target="_blank" >RIV/00216208:11320/14:10283341 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A COMBINATORIAL PROOF OF RAYLEIGH MONOTONICITY FOR GRAPHS
Original language description
We give an elementary, self-contained, and purely combinatorial proof of the Rayleigh monotonicity property of graphs.
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/ME09074" target="_blank" >ME09074: DIMACS-DIMATIA REU (International REU)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
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
Ars Combinatoria
ISSN
0381-7032
e-ISSN
—
Volume of the periodical
117
Issue of the periodical within the volume
October
Country of publishing house
CA - CANADA
Number of pages
16
Pages from-to
333-348
UT code for WoS article
000342333400026
EID of the result in the Scopus database
—