Extremal problems in hypergraph colourings
AM Raigorodskii, DD Cherkashin - Russian Mathematical …, 2020 - iopscience.iop.org
Extremal problems in hypergraph colouring originate implicitly from Hilbert's theorem on
monochromatic affine cubes (1892) and van der Waerden's theorem on monochromatic …
monochromatic affine cubes (1892) and van der Waerden's theorem on monochromatic …
Экстремальные задачи в раскрасках гиперграфов
АМ Райгородский, ДД Черкашин - Успехи математических наук, 2020 - mathnet.ru
Начнем с базовых определений. Пара множеств H:=(V, E) называется гиперграфом,
если V конечно, а E⊂ 2V. При этом V называется множеством вершин, а E …
если V конечно, а E⊂ 2V. При этом V называется множеством вершин, а E …
A note on two-colorability of nonuniform hypergraphs
L Duraj, G Gutowski, J Kozik - arXiv preprint arXiv:1803.03060, 2018 - arxiv.org
For a hypergraph $ H $, let $ q (H) $ denote the expected number of monochromatic edges
when the color of each vertex in $ H $ is sampled uniformly at random from the set of size 2 …
when the color of each vertex in $ H $ is sampled uniformly at random from the set of size 2 …
On small non-uniform hypergraphs without property B
D Cherkashin - arXiv preprint arXiv:2303.03803, 2023 - arxiv.org
For a given hypergraph $ H=(V, E) $ consider the sum $ q (H) $ of $2^{-| e|} $ over $ e\in E $.
Consider the class of hypergraphs with the smallest edge of size $ n $ and without a 2 …
Consider the class of hypergraphs with the smallest edge of size $ n $ and without a 2 …
Property B: Two-coloring non-uniform hypergraphs
J Radhakrishnan, A Srinivasan - 41st IARCS Annual Conference …, 2021 - drops.dagstuhl.de
The following is a classical question of Erdős (Nordisk Matematisk Tidskrift, 1963) and of
Erdős and Lovász (Colloquia Mathematica Societatis János Bolyai, vol. 10, 1975). Given a …
Erdős and Lovász (Colloquia Mathematica Societatis János Bolyai, vol. 10, 1975). Given a …
广义r-部完全超图的边色数
王娜， 张雁楠， 蔡俊亮， 陈星 - 北京师范大学学报(自然科学版), 2018 - bnujournal.com
研究了广义r-部完全超图的边色数的问题. 在r-部完全超图与t-一致完全超图的着色基础上,
确定一类特殊的广义r-部完全超图的边色数, 对一般的广义r-部完全超图的边色数给出了上界 …
确定一类特殊的广义r-部完全超图的边色数, 对一般的广义r-部完全超图的边色数给出了上界 …
Reduction of the retransmission delay for heterogeneous devices in dynamic opportunistic device-to-device network
S Chen, W Zou, X Liu, Y Zhao… - KSII Transactions on …, 2018 - koreascience.kr
The dynamic opportunistic device-to-device (DO-D2D) network will frequently emerge in the
fifth generation (5G) wireless communication due to high-density and fast-moving mobile …
fifth generation (5G) wireless communication due to high-density and fast-moving mobile …
Equitable colorings of nonuniform hypergraphs
IR Shirgazina - Mathematical Notes, 2016 - Springer
The well-known extremal problem on hypergraph colorings is studied. We investigate
whether it is possible to color a hypergraph with a fixed number of colors equitably, ie, so …
whether it is possible to color a hypergraph with a fixed number of colors equitably, ie, so …
On some generalizations of the property -problem of an -uniform hypergraph
Y Demidovich - arXiv preprint arXiv:1903.11708, 2019 - arxiv.org
The extremal problem of hypergraph colorings related to Erd\H {o} s--Hajnal property $ B $-
problem is considered. Let $ k $ be a natural number. The problem is to find the value of …
problem is considered. Let $ k $ be a natural number. The problem is to find the value of …
On Some Generalizations of the Property B Problem of an n-Uniform Hypergraph
YA Demidovich - Journal of Mathematical Sciences, 2022 - Springer
The extremal problem of hypergraph colorings related to the Erdős–Hajnal property B-
problem is considered. Let k be a natural number. The problem is to find the value of mk (n) …
problem is considered. Let k be a natural number. The problem is to find the value of mk (n) …