Extremal problems in hypergraph colourings
From MaRDI portal
Recommendations
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- Extremal problems for panchromatic colourings of uniform hypergraphs
- Extremal problems for colourings of uniform hypergraphs
- Lower bounds for the number of edges in hypergraphs of certain classes
- On the problem of Erdős and Hajnal in the case of list colorings
Cites work
- ``Integer-making theorems
- A Construction for Partitions Which Avoid Long Arithmetic Progressions
- A generalization of Kónig's theorem
- A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families
- A new lower bound for van der Waerden numbers
- A new proof of Szemerédi's theorem
- A Note on a Combinatorial Problem of ErdŐS and Hajnal
- A note on a series of families constructed over the cyclic graph
- A note on embedding hypertrees
- A note on panchromatic colorings
- A note on random greedy coloring of uniform hypergraphs
- A note on the Beck-Fiala theorem
- A note on two-colorability of nonuniform hypergraphs
- A panorama of discrepancy theory
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- A remark concerning arithmetic progressions
- A short nonalgorithmic proof of the containers theorem for hypergraphs
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- An extremal problem in hypergraph coloring
- An improved lower bound for Folkman's theorem
- An improvement of the Beck-Fiala theorem
- An Ore-type theorem on equitable coloring
- An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
- Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
- Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
- Bounds for the disjoint unions theorem
- Choice Numbers of Graphs: a Probabilistic Approach
- Chromatic number, girth and maximal degree
- Color-critical graphs and hypergraphs with few edges: a survey
- Coloring H-free hypergraphs
- Coloring cross-intersecting families
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Coloring hypergraphs with bounded cardinalities of edge intersections
- Coloring n-sets red and blue
- Coloring non-uniform hypergraphs without short cycles
- Coloring triangle-free graphs with fixed size
- Coloring uniform hypergraphs with few colors
- Coloring uniform hypergraphs with few edges
- Colorings of b-simple hypergraphs
- Colorings of hypergraphs with large number of colors
- Colourings of uniform hypergraphs with large girth and applications
- Constructions of sparse uniform hypergraphs with high chromatic number
- Counting independent sets in graphs
- Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
- Density conditions for panchromatic colourings of hypergraphs
- Ein kombinatorisches Problem von P. Erdős und A. Hajnal
- Equipartite colorings in graphs and hypergraphs
- Equitable colorings of hypergraphs with few edges
- Equitable colorings of non-uniform simple hypergraphs
- Equitable colorings of nonuniform hypergraphs
- Equitable two-colorings of uniform hypergraphs
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Extremal problems concerning Kneser-graphs
- Extremal Problems for Affine Cubes of Integers
- Extremal problems for colourings of uniform hypergraphs
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Extremal uncrowded hypergraphs
- Geometric discrepancy. An illustrated guide
- Graph Theory and Probability
- Greedy colorings of uniform hypergraphs
- scientific article; zbMATH DE number 4014740 (Why is no real title available?)
- scientific article; zbMATH DE number 5825874 (Why is no real title available?)
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 446487 (Why is no real title available?)
- scientific article; zbMATH DE number 3659621 (Why is no real title available?)
- scientific article; zbMATH DE number 3668662 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 3756479 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 3485832 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 3563170 (Why is no real title available?)
- scientific article; zbMATH DE number 3568732 (Why is no real title available?)
- scientific article; zbMATH DE number 3616474 (Why is no real title available?)
- scientific article; zbMATH DE number 1380611 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- scientific article; zbMATH DE number 3414305 (Why is no real title available?)
- scientific article; zbMATH DE number 3188524 (Why is no real title available?)
- Hypergraph containers
- Hypergraph list coloring and Euclidean Ramsey theory
- Hypergraph theory. An introduction
- Hypergraphs with high chromatic number
- Improved algorithms for colorings of simple hypergraphs and applications
- Improved bounds and algorithms for hypergraph 2-coloring
- Improved Bounds for Uniform Hypergraphs without Property B
- Improved lower bounds on k‐independence
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
- Independent sets in hypergraphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Invitation to intersection problems for finite sets
- List coloring hypergraphs
- List colourings of regular hypergraphs
- Measurable versions of the Lovász local lemma and measurable graph colorings
- Monochromatic Hilbert cubes and arithmetic progressions
- Monochromatic sumsets
- Multipass greedy coloring of simple uniform hypergraphs
- Note on independent sets in steiner systems
- On 3-chromatic hypergraphs
- On r-chromatic hypergraphs
- On A Combinatorial Problem III
- On A Combinatorial Problem of Erdös
- On a Combinatorial Problem of Erdös and Hajnal
- On a combinatorial problem of P. Erdős and L. Lovasz
- On a combinatorial problem. II
- On a generalization of Rubin's theorem
- On a property of families of sets
- On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
- On Brooks' Theorem for Sparse Graphs
- On chromatic number of graphs and set-systems
- On chromatic numbers of close-to-Kneser distance graphs
- On general two-colorings of uniform hypergraphs
- On hypergraph cliques with chromatic number 3
- On one combinatorial problem of Erdös
- On proper colourings of hypergraphs using prescribed colours
- On small \(n\)-uniform hypergraphs with positive discrepancy
- On the Beck-Fiala theorem
- On the chromatic number of finite systems of subsets
- On the chromatic number of set systems
- On the chromatic number of Steiner triple systems of order 25
- On the chromatic number of the general Kneser-graph
- On the construction of 3-chromatic hypergraphs with few edges
- On the construction of non-2-colorable uniform hypergraphs
- On the dimension of the Hilbert cubes
- On the lower bound for the chromatic number of graphs with given maximal degree and girth
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- On the number of graphs without 4-cycles
- ON THE TWO-COLOURING OF HYPERGRAPHS
- On uncrowded hypergraphs
- Online containers for hypergraphs, with applications to linear equations
- Problems and results on judicious partitions
- Properties of the Steiner triple systems of order 19
- Quantitative forms of a theorem of Hilbert
- Random coloring method in the combinatorial problem of Erdős and Lovász
- Randomized algorithms for colourings of hypergraphs
- Regular bipartite graphs and intersecting families
- Short proofs of some extremal results
- Simple containers for simple hypergraphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The \(B_r\) property and chromatic numbers of generalized graphs
- The Asymptotic Number of Lattices
- The CRC handbook of combinatorial designs
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- The existence of panchromatic colourings for uniform hypergraphs
- The hardness of 3-uniform hypergraph coloring
- The inducibility of graphs
- The method of hypergraph containers
- The minimum independence number for designs
- The probabilistic method
- The smallest n-uniform hypergraph with positive discrepancy
- Top-down lower bounds for depth-three circuits
- Trees in greedy colorings of hypergraphs
- Upper bounds for Turán numbers
- What we know and what we do not know about Turán numbers
Cited in
(27)- Stability of extremal hypergraphs with applications to an edge-coloring problem
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring
- 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)\)
- Chain method for panchromatic colorings of hypergraphs
- A generalization of Kneser graphs
- 2-colorings of hypergraphs with large girth
- On stability of the independence number of a certain distance graph
- 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
- Colorings of hypergraphs
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- Regular behavior of the maximal hypergraph chromatic number
- On Some Extremal Properties of Hypergraph Colorings
- scientific article; zbMATH DE number 1047736 (Why is no real title available?)
- scientific article; zbMATH DE number 3999957 (Why is no real title available?)
- A class of Ramsey-extremal hypergraphs
- scientific article; zbMATH DE number 4196000 (Why is no real title available?)
- Extremal H‐Colorings of Graphs with Fixed Minimum Degree
- Extremal problems for colourings of uniform hypergraphs
- The intersection spectrum of 3‐chromatic intersecting hypergraphs
- Erdős-Hajnal problem for \(H\)-free hypergraphs
- Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs
- On two-colorings of hypergraphs
- The intersection spectrum of 3-chromatic intersecting hypergraphs
- Random unconditional convergence of Rademacher chaos in L_ and sharp estimates for discrepancy of weighted graphs and hypergraphs
- One property of the multiple Rademacher system and its applications to problems of graph discrepancy
This page was built for publication: Extremal problems in hypergraph colourings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5112450)
