On the Erdős-Hajnal problem for 3-graphs
type: Item
instance of: scholarly article
title: On the Erdős-Hajnal problem for 3-graphs
zbMATH Open document ID: 1464.05273
published in: Journal of Mathematical Sciences (New York)
publication date: 2021-05-26T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7351192
zbMATH Keywords: Turán number
zbMATH Keywords: Erdős conjecture
author: Danila Cherkashin
MaRDI profile type: Publication
full work available at URL: s10958-021-05352-z
OpenAlex ID: W3154533856
cites work: Colorings of hypergraphs with large number of colors
cites work: Hypergraphs with high chromatic number
cites work: Regular Behavior of the Maximal Hypergraph Chromatic Number
cites work: A note on random greedy coloring of uniform hypergraphs
cites work: Q3866151
cites work: On a property of families of sets
cites work: The inducibility of graphs
cites work: Greedy colorings of uniform hypergraphs
cites work: The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
cites work: What we know and what we do not know about Turán numbers
DOI: 10.1007/S10958-021-05352-Z
Recommended article: On the Erdős-Hajnal problem for 3-uniform hypergraphs
Recommended article: A problem of Erdős and Sós on 3-graphs
Recommended article: Q3699700
Recommended article: Q3348933
Recommended article: Q3114952
Recommended article: On ramsey-tuŕan numbers for 3-graphs
Recommended article: Q3734434
Recommended article: On \(3^*\)-connected graphs
Recommended article: An exact result for 3-graphs
description: scientific article; zbMATH DE number 7351192