Zobrazeno 1 - 2
of 2
pro vyhledávání: '"András Imolay"'
Publikováno v:
Discrete Mathematics. 345:112886
In this article we investigate a problem in graph theory, which has an equivalent reformulation in extremal set theory similar to the problems researched in "A general 2-part Erd\H{o}s-Ko-Rado theorem" by Gyula O.H. Katona, who proposed our problem a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f969bc1495e2a69068ce81f04e500c1
https://doi.org/10.1016/j.disc.2022.112886
https://doi.org/10.1016/j.disc.2022.112886
Autor:
Péter Csikvári, András Imolay
Given a graph $G$ with only even degrees, let $\varepsilon(G)$ denote the number of Eulerian orientations, and let $h(G)$ denote the number of half graphs, that is, subgraphs $F$ such that $d_F(v)=d_G(v)/2$ for each vertex $v$. Recently, Borbényi an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fad6669c95ccaa6934866ba0f3ea561d
http://arxiv.org/abs/1905.06678
http://arxiv.org/abs/1905.06678
