Extremal problems in hypergraph colourings
From MaRDI portal
Publication:5112450
DOI10.1070/RM9905zbMath1440.05096OpenAlexW3007558129MaRDI QIDQ5112450
Danila Cherkashin, Andrei M. Raigorodskii
Publication date: 29 May 2020
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/rm9905
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)
Related Items
Chain method for panchromatic colorings of hypergraphs, The intersection spectrum of 3‐chromatic intersecting hypergraphs, A generalization of Kneser graphs, Erdős-Hajnal problem for \(H\)-free hypergraphs, 2-colorings of hypergraphs with large girth, On stability of the independence number of a certain distance graph, Regular Behavior of the Maximal Hypergraph Chromatic Number, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Estimate of the number of edges in subgraphs of a Johnson graph, New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\), Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- Equitable colorings of non-uniform simple hypergraphs
- Equitable colorings of nonuniform hypergraphs
- Online containers for hypergraphs, with applications to linear equations
- On hypergraph cliques with chromatic number 3
- Equitable two-colorings of uniform hypergraphs
- On the construction of non-2-colorable uniform hypergraphs
- Hypergraph containers
- An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
- Trees in greedy colorings of hypergraphs
- On \(r\)-chromatic hypergraphs
- On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
- Invitation to intersection problems for finite sets
- Coloring non-uniform hypergraphs without short cycles
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- On general two-colorings of uniform hypergraphs
- On one combinatorial problem of Erdös
- Improved algorithms for colorings of simple hypergraphs and applications
- Properties of the Steiner triple systems of order 19
- A note on embedding hypertrees
- On the chromatic number of finite systems of subsets
- Extremal problems concerning Kneser-graphs
- Quantitative forms of a theorem of Hilbert
- Hypergraphs with high chromatic number
- The smallest n-uniform hypergraph with positive discrepancy
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Monochromatic sumsets
- On the dimension of the Hilbert cubes
- On 3-chromatic hypergraphs
- Coloring n-sets red and blue
- A remark concerning arithmetic progressions
- Bounds for the disjoint unions theorem
- ``Integer-making theorems
- Extremal uncrowded hypergraphs
- On the number of graphs without 4-cycles
- The inducibility of graphs
- An extremal problem in hypergraph coloring
- Equipartite colorings in graphs and hypergraphs
- On a combinatorial problem of P. Erdős and L. Lovasz
- Chromatic number, girth and maximal degree
- Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
- A note on the Beck-Fiala theorem
- Coloring triangle-free graphs with fixed size
- Density conditions for panchromatic colourings of hypergraphs
- A new lower bound for van der Waerden numbers
- Regular bipartite graphs and intersecting families
- Colorings of \(b\)-simple hypergraphs
- A note on panchromatic colorings
- A note on a series of families constructed over the cyclic graph
- Coloring cross-intersecting families
- On the Beck-Fiala theorem
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- The minimum independence number for designs
- What we know and what we do not know about Turán numbers
- Top-down lower bounds for depth-three circuits
- Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
- Hypergraph theory. An introduction
- List coloring hypergraphs
- Coloring hypergraphs with bounded cardinalities of edge intersections
- Equitable colorings of hypergraphs with few edges
- Measurable versions of the Lovász local lemma and measurable graph colorings
- On small \(n\)-uniform hypergraphs with positive discrepancy
- Counting independent sets in graphs
- On the construction of 3-chromatic hypergraphs with few edges
- Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
- On chromatic numbers of close-to-Kneser distance graphs
- The hardness of 3-uniform hypergraph coloring
- Monochromatic Hilbert cubes and arithmetic progressions
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- A panorama of discrepancy theory
- An Ore-type theorem on equitable coloring
- The \(B_r\) property and chromatic numbers of generalized graphs
- On the chromatic number of Steiner triple systems of order 25
- On the lower bound for the chromatic number of graphs with given maximal degree and girth
- On the chromatic number of set systems
- List Colourings of Regular Hypergraphs
- On a generalization of Rubin's theorem
- Greedy colorings of uniform hypergraphs
- Coloring uniform hypergraphs with few edges
- Coloring H-free hypergraphs
- Constructions of sparse uniform hypergraphs with high chromatic number
- On proper colourings of hypergraphs using prescribed colours
- Hypergraph list coloring and Euclidean Ramsey theory
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- Random coloring method in the combinatorial problem of Erdős and Lovász
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- Graph Theory and Probability
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A note on random greedy coloring of uniform hypergraphs
- Multipass greedy coloring of simple uniform hypergraphs
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- The existence of panchromatic colourings for uniform hypergraphs
- On the chromatic number of the general Kneser-graph
- The Asymptotic Number of Lattices
- Improved lower bounds on k‐independence
- ON THE TWO-COLOURING OF HYPERGRAPHS
- Note on independent sets in steiner systems
- Choice Numbers of Graphs: a Probabilistic Approach
- Extremal Problems for Affine Cubes of Integers
- Coloring uniform hypergraphs with few colors
- A short nonalgorithmic proof of the containers theorem for hypergraphs
- Colourings of Uniform Hypergraphs with Large Girth and Applications
- On uncrowded hypergraphs
- A Note on a Combinatorial Problem of ErdŐS and Hajnal
- Problems and results on judicious partitions
- On Brooks' Theorem for Sparse Graphs
- Randomized algorithms for colourings of hypergraphs
- Improved bounds and algorithms for hypergraph 2-coloring
- A note on two-colorability of nonuniform hypergraphs
- Improved Bounds for Uniform Hypergraphs without Property B
- THE METHOD OF HYPERGRAPH CONTAINERS
- A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families
- Independent sets in hypergraphs
- On a Combinatorial Problem of Erdös and Hajnal
- An improved lower bound for Folkman's theorem
- An Improvement of the Beck–Fiala Theorem
- Simple Containers for Simple Hypergraphs
- Short Proofs of Some Extremal Results
- Extremal problems for colourings of uniform hypergraphs
- Ein kombinatorisches Problem von P. Erdős und A. Hajnal
- On chromatic number of graphs and set-systems
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A Construction for Partitions Which Avoid Long Arithmetic Progressions
- On A Combinatorial Problem of Erdös
- On A Combinatorial Problem III
- On a property of families of sets
- On a combinatorial problem. II
- A generalization of Kónig's theorem
- Colorings of hypergraphs with large number of colors
- Geometric discrepancy. An illustrated guide
- A new proof of Szemerédi's theorem
- Upper bounds for Turán numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
