scientific article; zbMATH DE number 3492718

Recommendations

scientific article; zbMATH DE number 3470458
On the Erdős-Hajnal problem for 3-uniform hypergraphs
scientific article; zbMATH DE number 3453607
The Chromatic Number of Kneser Hypergraphs
On the chromatic number of set systems

Cited in

(only showing first 100 items - show all)

Finding occurrences of protein complexes in protein-protein interaction graphs
The triangle-free process
\(l\)-trace \(k\)-Sperner families of sets
Critical hypergraphs and interesting set-pair systems
More on maximal intersecting families of finite sets
Hypergraphs with high chromatic number
Probabilistic methods
Cycles of length 0 modulo k in directed graphs
The linear arboricity of graphs
On 3-chromatic hypergraphs
On maximal intersecting families of finite sets
On positional games
A remark concerning arithmetic progressions
Independent sets in regular graphs and sum-free subsets of finite groups
Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
On-line algorithms for 2-coloring hypergraphs via chip games
On a combinatorial problem of P. Erdős and L. Lovasz
On codes with the identifiable parent property
Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
On a graph colouring problem
A strengthening of Brooks' theorem
Probabilistic methods in coloring and decomposition problems
Acyclic edge-colorings of sparse graphs
Inequalities for minimal covering sets in set systems of given rank
Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
From Erdős to algorithms
Covering with Latin transversals
A bound on the strong chromatic index of a graph
Fractional v. integral covers in hypergraphs of bounded edge size
Domination by product measures
Hypergraph colouring and the Lovász local lemma
On incidence coloring and star arboricity of graphs
Blocking set free configurations and their relations to digraphs and hypergraphs
Four results about self-blocking clutters
Independent dominating sets and a second hamiltonian cycle in regular graphs
Bounded size components -- partitions and transversals.
Ramsey numbers involving large dense graphs and bipartite Turán numbers
Reroute sequence planning in telecommunication networks and compact vector summation.
Vertices of small degree in uniquely Hamiltonian graphs
Linear coloring of graphs
Perfect hash families: Probabilistic methods and explicit constructions
On a combinatorial framework for fault characterization
The list chromatic number of graphs with small clique number
A new lower bound for van der Waerden numbers
A degree version of the Hilton-Milner theorem
Colorings of b-simple hypergraphs
Panchromatic 3-coloring of a random hypergraph
A note on panchromatic colorings
The lonely runner problem for lacunary sequences
The Lovász local lemma and variable strength covering arrays
A note on a series of families constructed over the cyclic graph
The Cayley isomorphism property for Cayley maps
Coloring cross-intersecting families
Assouad's theorem with dimension independent of the snowflaking
Generalizations of the Kolmogorov-Barzdin embedding estimates
Testing hypergraph colorability
Maximal intersecting families and affine regular polygons in PG(2,q)
Graphs with a small number of distinct induced subgraphs
Minimum number of elements of representing a set system of given rank
The star arboricity of graphs
Edge weights and vertex colours
Variations on a game
On Erdős-Rado numbers
Uniform intersecting families with covering number four
Branching rules for satisfiability
Some properties of non-bicolorable hypergraphs and the four-color problem
Maximal intersection critical families of finite sets
Strengthening hash families and compressive sensing
On cycle systems with specified weak chromatic number
Towards the linear arboricity conjecture
Weighted dependency graphs
Panchromatic colorings of random hypergraphs
Polychromatic colorings and cover decompositions of hypergraphs
Reliable communication over highly connected noisy networks
Entropy compression versus Lovász local lemma
Injective edge-coloring of graphs with given maximum degree
Coloring graphs without bichromatic cycles or paths
Randomized construction of complexes with large diameter
Variations on twins in permutations
Train tracks with gaps: applying the probabilistic method to trains
When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence
On the maximum number of distinct intersections in an intersecting family
On the maximal number of elements pairwise generating the symmetric group of even degree
Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings
New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
Injective edge-coloring of graphs with small weight
From one to many rainbow Hamiltonian cycles
High girth hypergraphs with unavoidable monochromatic or rainbow edges
Local boxicity
Pseudo sunflowers
Choice number of Kneser graphs
Covering metric spaces by few trees
Graph \(r\)-hued colorings -- a survey
Chain method for panchromatic colorings of hypergraphs
Bisecting and \(D\)-secting families for set systems
Mallows permutations and finite dependence
Long directed rainbow cycles and rainbow spanning trees
Concepts on coloring of cluster hypergraphs with application
2-colorings of hypergraphs with large girth
Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4074927)