On some generalizations of the property b problem of an nuniform hypergraph

Yu A. Demidovich

On some generalizations of the property b problem of an nuniform hypergraph

Yu A. Demidovich^*

^*Corresponding author for this work

Computer Science

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

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 m_k(n) equal to the minimal number of edges in an n-uniform hypergraph that does not admit 2-colorings of the vertex set such that every edge of the hypergraph contains at least k vertices of each color. In this paper, e obtain new lower bounds for m(n).

Original language	English (US)
Pages (from-to)	95-122
Number of pages	28
Journal	Fundamental and Applied Mathematics
Volume	23
Issue number	1
State	Published - 2020

Bibliographical note

Publisher Copyright:
© 2020 National Open University "INTUIT".

ASJC Scopus subject areas

Analysis
Algebra and Number Theory
Geometry and Topology
Applied Mathematics

Cite this

@article{bf215888214f4f1e91ce659b02367694,

title = "On some generalizations of the property b problem of an nuniform hypergraph",

abstract = "The extremal problem of hypergraph colorings related to the Erd{\H o}s–Hajnal property B-problem is considered. Let k be a natural number. The problem is to find the value of mk(n) equal to the minimal number of edges in an n-uniform hypergraph that does not admit 2-colorings of the vertex set such that every edge of the hypergraph contains at least k vertices of each color. In this paper, e obtain new lower bounds for m(n).",

author = "Demidovich, {Yu A.}",

note = "Publisher Copyright: {\textcopyright} 2020 National Open University {"}INTUIT{"}.",

year = "2020",

language = "English (US)",

volume = "23",

pages = "95--122",

journal = "Fundamental and Applied Mathematics",

issn = "1560-5159",

publisher = "Moscow State University",

number = "1",

}

TY - JOUR

T1 - On some generalizations of the property b problem of an nuniform hypergraph

AU - Demidovich, Yu A.

PY - 2020

Y1 - 2020

N2 - 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) equal to the minimal number of edges in an n-uniform hypergraph that does not admit 2-colorings of the vertex set such that every edge of the hypergraph contains at least k vertices of each color. In this paper, e obtain new lower bounds for m(n).

AB - 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) equal to the minimal number of edges in an n-uniform hypergraph that does not admit 2-colorings of the vertex set such that every edge of the hypergraph contains at least k vertices of each color. In this paper, e obtain new lower bounds for m(n).

UR - http://www.scopus.com/inward/record.url?scp=85092154375&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85092154375

SN - 1560-5159

VL - 23

SP - 95

EP - 122

JO - Fundamental and Applied Mathematics

JF - Fundamental and Applied Mathematics

IS - 1

ER -

On some generalizations of the property b problem of an nuniform hypergraph

Abstract

Bibliographical note

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this