Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Sergey Norin"'
Autor:
SERGEY NORIN
Publikováno v:
Forum of Mathematics, Sigma, Vol 7 (2019)
We construct an $S_{3}$-symmetric probability distribution on $\{(a,b,c)\in \mathbb{Z}_{{\geqslant}0}^{3}\,:\,a+b+c=n\}$ such that its marginal achieves the maximum entropy among all probability distributions on $\{0,1,\ldots ,n\}$ with mean $n/3$. E
Externí odkaz:
https://doaj.org/article/c908540b1d634220961e8575a427e78a
Autor:
Sergey Norin, Luke Postle
Publikováno v:
Journal of Combinatorial Theory, Series B. 158:283-300
In 1943, Hadwiger conjectured that every graph with no K t + 1 minor is t-colorable for every t ≥ 0 . While Hadwiger's conjecture does not hold for list-coloring, the linear weakening is conjectured to be true. In the 1980 s, Kostochka and Thomason
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6d8b44f0b43a9de3c7f5bc2f43026ae
https://doi.org/10.1016/j.jctb.2021.02.001
https://doi.org/10.1016/j.jctb.2021.02.001
Publikováno v:
Advances in Mathematics. 422:109020
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bad3537338704c791844a6b18af07a0
https://doi.org/10.1016/j.aim.2023.109020
https://doi.org/10.1016/j.aim.2023.109020
Publikováno v:
SIAM Journal on Discrete Mathematics. 35:1149-1164
We give a natural sufficient condition for an intersection graph of compact convex sets in R^d to have a balanced separator of sublinear size. This condition generalizes several previous results on sublinear separators in intersection graphs. Further
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4735afd9801567e7f0650b49f347c288
https://doi.org/10.1137/20m1311156
https://doi.org/10.1137/20m1311156
Publikováno v:
Duke Mathematical Journal. 171
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2f08b7b49b76cee59e7f26922a35e14
https://doi.org/10.1215/00127094-2021-0069
https://doi.org/10.1215/00127094-2021-0069
Autor:
David Eppstein, Robert Hickingbotham, Laura Merker, Sergey Norin, Michał T. Seweryn, David R. Wood
We prove that the stack-number of the strong product of three $n$-vertex paths is $\Theta(n^{1/3})$. The best previously known upper bound was $O(n)$. No non-trivial lower bound was known. This is the first explicit example of a graph family with bou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b2232f792c60d26a2fe6aebe859a2ef
Publikováno v:
Combinatorica. 39:1387-1412
The "clustered chromatic number" of a class of graphs is the minimum integer $k$ such that for some integer $c$ every graph in the class is $k$-colourable with monochromatic components of size at most $c$. We prove that for every graph $H$, the clust
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8372d316e0a76927e7af8ea1317e093
https://doi.org/10.1007/s00493-019-3848-z
https://doi.org/10.1007/s00493-019-3848-z
Publikováno v:
Combinatorica. 39:1149-1171
The extension of an r-uniform hypergraph G is obtained from it by adding for every pair of vertices of G, which is not covered by an edge in G, an extra edge containing this pair and (r−2) new vertices. In this paper we determine the Turan number o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02cab2bac124746dc2f5ad8a954b2b67
https://doi.org/10.1007/s00493-019-3831-8
https://doi.org/10.1007/s00493-019-3831-8
Publikováno v:
Journal of the Institute of Mathematics of Jussieu. 20:957-987
We show that certain right-angled Coxeter groups have finite index subgroups that quotient to $\mathbb Z$ with finitely generated kernels. The proof uses Bestvina-Brady Morse theory facilitated by combinatorial arguments. We describe a variety of exa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ca1c9a6090452c1d6a059afd02ed992
https://doi.org/10.1017/s1474748019000422
https://doi.org/10.1017/s1474748019000422
Publikováno v:
Algorithmic Game Theory ISBN: 9783030859466
SAGT
SAGT
The set of stable matchings induces a distributive lattice. The supremum of the stable matching lattice is the boy-optimal (girl-pessimal) stable matching and the infimum is the girl-optimal (boy-pessimal) stable matching. The classical boy-proposal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b970b4f7fa5e9ea4afb65ef070ccf18f
https://doi.org/10.1007/978-3-030-85947-3_19
https://doi.org/10.1007/978-3-030-85947-3_19