Extremal problems in hypergraph colourings (Q5112450)

scientific article; zbMATH DE number 7206499

Language	Label	Description	Also known as
English	Extremal problems in hypergraph colourings	scientific article; zbMATH DE number 7206499

Statements

instance of

scholarly article

0 references

title

Extremal problems in hypergraph colourings (English)

0 references

author

Danila Cherkashin

0 references

Andrei M. Raigorodskii

0 references

published in

Russian Mathematical Surveys

0 references

publication date

29 May 2020

0 references

zbMATH Keywords

extremal combinatorics

0 references

hypergraph colourings

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

On A Combinatorial Problem of Erdös

0 references

On a Combinatorial Problem of Erdös and Hajnal

0 references

Improved Bounds for Uniform Hypergraphs without Property B

0 references

Extremal uncrowded hypergraphs

0 references

Colorings of \(b\)-simple hypergraphs

0 references

Coloring hypergraphs with bounded cardinalities of edge intersections

0 references

Equitable colorings of hypergraphs with few edges

0 references

Colorings of hypergraphs with large number of colors

0 references

Hypergraphs with high chromatic number

0 references

Choice Numbers of Graphs: a Probabilistic Approach

0 references

Q3142409

0 references

The smallest n-uniform hypergraph with positive discrepancy

0 references

Hypergraph list coloring and Euclidean Ramsey theory

0 references

Q2798999

0 references

Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs

0 references

An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)

0 references

Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs

0 references

An improved lower bound for Folkman's theorem

0 references

Monochromatic Hilbert cubes and arithmetic progressions

0 references

Independent sets in hypergraphs

0 references

THE METHOD OF HYPERGRAPH CONTAINERS

0 references

On a combinatorial problem of P. Erdős and L. Lovasz

0 references

On 3-chromatic hypergraphs

0 references

A remark concerning arithmetic progressions

0 references

``Integer-making'' theorems

0 references

A note on the Beck-Fiala theorem

0 references

Q3993087

0 references

Equipartite colorings in graphs and hypergraphs

0 references

A Construction for Partitions Which Avoid Long Arithmetic Progressions

0 references

Measurable versions of the Lovász local lemma and measurable graph colorings

0 references

A short nonalgorithmic proof of the containers theorem for hypergraphs

0 references

A new lower bound for van der Waerden numbers

0 references

A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.

0 references

On chromatic numbers of close-to-Kneser distance graphs

0 references

Coloring H-free hypergraphs

0 references

Chromatic number, girth and maximal degree

0 references

Problems and results on judicious partitions

0 references

Hypergraph theory. An introduction

0 references

Quantitative forms of a theorem of Hilbert

0 references

An Improvement of the Beck–Fiala Theorem

0 references

Q4141279

0 references

Improved lower bounds on <i>k</i>‐independence

0 references

A panorama of discrepancy theory

0 references

On hypergraph cliques with chromatic number 3

0 references

Coloring cross-intersecting families

0 references

A note on panchromatic colorings

0 references

A note on random greedy coloring of uniform hypergraphs

0 references

On small \(n\)-uniform hypergraphs with positive discrepancy

0 references

Q3411976

0 references

Properties of the Steiner triple systems of order 19

0 references

Short Proofs of Some Extremal Results

0 references

Q5678865

0 references

The hardness of 3-uniform hypergraph coloring

0 references

On uncrowded hypergraphs

0 references

A note on two-colorability of nonuniform hypergraphs

0 references

Graph Theory and Probability

0 references

Q5724800

0 references

On a combinatorial problem. II

0 references

On A Combinatorial Problem III

0 references

Q3866151

0 references

On a property of families of sets

0 references

On chromatic number of graphs and set-systems

0 references

INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

0 references

Q4074927

0 references

Q3922703

0 references

Monochromatic sumsets

0 references

On the chromatic number of the general Kneser-graph

0 references

Erdős-Ko-Rado theorem with conditions on the maximal degree

0 references

A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families

0 references

Extremal problems concerning Kneser-graphs

0 references

Covers in uniform intersecting families and a counterexample to a conjecture of Lovász

0 references

Invitation to intersection problems for finite sets

0 references

On the construction of 3-chromatic hypergraphs with few edges

0 references

Coloring triangle-free graphs with fixed size

0 references

A new proof of Szemerédi's theorem

0 references

The minimum independence number for designs

0 references

Extremal Problems for Affine Cubes of Integers

0 references

Extremal problems for sets forming Boolean algebras and complete partite hypergraphs

0 references

Trees in greedy colorings of hypergraphs

0 references

Q5620621

0 references

Top-down lower bounds for depth-three circuits

0 references

List coloring hypergraphs

0 references

On the dimension of the Hilbert cubes

0 references

On the Beck-Fiala theorem

0 references

The \(B_r\) property and chromatic numbers of generalized graphs

0 references

SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

0 references

On the chromatic number of Steiner triple systems of order 25

0 references

Q3089368

0 references

An Ore-type theorem on equitable coloring

0 references

A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring

0 references

On Brooks' Theorem for Sparse Graphs

0 references

The Asymptotic Number of Lattices

0 references

On the number of graphs without 4-cycles

0 references

On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs

0 references

Coloring uniform hypergraphs with few colors

0 references

Q5477816

0 references

Coloring uniform hypergraphs with few edges

0 references

Q3858291

0 references

On the chromatic number of set systems

0 references

Q4705347

0 references

Constructions of sparse uniform hypergraphs with high chromatic number

0 references

Q3060863

0 references

Density conditions for panchromatic colourings of hypergraphs

0 references

Multipass greedy coloring of simple uniform hypergraphs

0 references

Improved algorithms for colorings of simple hypergraphs and applications

0 references

Colourings of Uniform Hypergraphs with Large Girth and Applications

0 references

Regular bipartite graphs and intersecting families

0 references

Q3939805

0 references

A note on embedding hypertrees

0 references

A generalization of Kónig's theorem

0 references

Q4180391

0 references

A note on a series of families constructed over the cyclic graph

0 references

On the construction of non-2-colorable uniform hypergraphs

0 references

Geometric discrepancy. An illustrated guide

0 references

The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families

0 references

On the minimum size of 4-uniform hypergraphs without property \(B\)

0 references

Q3027024

0 references

The inducibility of graphs

0 references

Greedy colorings of uniform hypergraphs

0 references

Improved bounds and algorithms for hypergraph 2-coloring

0 references

The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems

0 references

Note on independent sets in steiner systems

0 references

On general two-colorings of uniform hypergraphs

0 references

On proper colourings of hypergraphs using prescribed colours

0 references

Counting independent sets in graphs

0 references

List Colourings of Regular Hypergraphs

0 references

Hypergraph containers

0 references

Online containers for hypergraphs, with applications to linear equations

0 references

Simple Containers for Simple Hypergraphs

0 references

Ein kombinatorisches Problem von P. Erdős und A. Hajnal

0 references

A Note on a Combinatorial Problem of ErdŐS and Hajnal

0 references

ON THE TWO-COLOURING OF HYPERGRAPHS

0 references

On one combinatorial problem of Erdös

0 references

Extremal problems for colourings of uniform hypergraphs

0 references

Randomized algorithms for colourings of hypergraphs

0 references

On the chromatic number of finite systems of subsets

0 references

Improvement of the lower bound in the Erdös-Hajnal combinatorial problem

0 references

The existence of panchromatic colourings for uniform hypergraphs

0 references

On a generalization of Rubin's theorem

0 references

On \(r\)-chromatic hypergraphs

0 references

Random coloring method in the combinatorial problem of Erdős and Lovász

0 references

Coloring non-uniform hypergraphs without short cycles

0 references

Around Erdős-Lovász problem on colorings of non-uniform hypergraphs

0 references

Equitable two-colorings of uniform hypergraphs

0 references

Equitable colorings of non-uniform simple hypergraphs

0 references

Equitable colorings of nonuniform hypergraphs

0 references

What we know and what we do not know about Turán numbers

0 references

Upper bounds for Turán numbers

0 references

Coloring n-sets red and blue

0 references

An extremal problem in hypergraph coloring

0 references

An application of Lovász' local lemma-A new lower bound for the van der Waerden number

0 references

On the lower bound for the chromatic number of graphs with given maximal degree and girth

0 references

Bounds for the disjoint unions theorem

0 references

Q4068746

0 references

Q4135588

0 references

full work available at URL

https://doi.org/10.1070/rm9905

0 references

Identifiers

zbMATH Open document ID

1440.05096

0 references

DOI

10.1070/RM9905

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5112450