scientific article

zbMath0315.05117MaRDI QIDQ4074927

No author found.

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Problem books (00A07) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (only showing first 100 items - show all)

Coloring Block Designs is NP-Complete ⋮ Coloring Steiner Triple Systems ⋮ Independent transversals in bipartite correspondence-covers ⋮ On Conflict-Free Multi-coloring ⋮ A note on saturation for $k$-wise intersecting families ⋮ Commutativity in the Algorithmic Lovász Local Lemma ⋮ A note on two-colorability of nonuniform hypergraphs ⋮ Partial Resampling to Approximate Covering Integer Programs ⋮ A General Framework for Hypergraph Coloring ⋮ Adaptable and conflict colouring multigraphs with no cycles of length three or four ⋮ The intersection spectrum of 3‐chromatic intersecting hypergraphs ⋮ Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ The list linear arboricity of graphs ⋮ Lower bounds on the Erdős–Gyárfás problem via color energy graphs ⋮ Asymptotically good edge correspondence colourings ⋮ The Erdős–Gyárfás function with respect to Gallai‐colorings ⋮ Detecting arrays for effects of single factors ⋮ The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree ⋮ Distributed algorithms, the Lovász local lemma, and descriptive combinatorics ⋮ Independence numbers of Johnson-type graphs ⋮ Unnamed Item ⋮ Extremal bipartite independence number and balanced coloring ⋮ Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ Inapproximability of counting independent sets in linear hypergraphs ⋮ Size Gallai-Ramsey number ⋮ Coloring unions of nearly disjoint hypergraph cliques ⋮ Total colorings-a survey ⋮ Attacks and alignments: rooks, set partitions, and permutations ⋮ Probability bounds for \(n\) random events under \((n-1)\)-wise independence ⋮ Extremal problems in hypergraph colourings ⋮ Uniform intersecting families with large covering number ⋮ Packing list‐colorings ⋮ Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited ⋮ Distributed coloring of hypergraphs ⋮ Bounds on the higher degree Erdős-Ginzburg-Ziv constants over \({\mathbb{F}}_q^n\) ⋮ Defective coloring of hypergraphs ⋮ Max-norm Ramsey theory ⋮ Unnamed Item ⋮ The structure of large intersecting families ⋮ FINITELY DEPENDENT COLORING ⋮ Equivariant maps to subshifts whose points have small stabilizers ⋮ Unnamed Item ⋮ Arithmetic Progressions and Tic-Tac-Toe Games ⋮ A short proof of Bernoulli disjointness via the local lemma ⋮ Properly colored and rainbow copies of graphs with few cherries ⋮ Colorings of hypergraphs with large number of colors ⋮ Crumbling walls: a class of practical and efficient quorum systems ⋮ Online Ramsey Numbers and the Subgraph Query Problem ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Diversity ⋮ Colourings of Uniform Hypergraphs with Large Girth and Applications ⋮ Separation dimension and degree ⋮ An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles ⋮ Coloring Sparse Hypergraphs ⋮ Better bounds for poset dimension and boxicity ⋮ Distributed algorithms for the Lovász local lemma and graph coloring ⋮ A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families ⋮ Average probe complexity in quorum systems ⋮ Covering Metric Spaces by Few Trees ⋮ Counting Hypergraph Colorings in the Local Lemma Regime ⋮ Shearer's point process, the hard-sphere model, and a continuum Lovász local lemma ⋮ Finding independent transversals efficiently ⋮ Matching criticality in intersecting hypergraphs ⋮ Non-proper edge-colouring of graphs and hereditary graph properties ⋮ Independent dominating sets in graphs of girth five ⋮ Optimal Construction of Edge-Disjoint Paths in Random Graphs ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ Unnamed Item ⋮ Hitting times for Shamir’s problem ⋮ Local boxicity ⋮ Waiter-client and client-waiter colourability and \(k\)-SAT games ⋮ Majority colourings of digraphs ⋮ Secret sharing on large girth graphs ⋮ Uniform intersecting families with covering number four ⋮ Pseudo sunflowers ⋮ Contraction of areas vs. topology of mappings ⋮ Branching rules for satisfiability ⋮ Choice number of Kneser graphs ⋮ Rainbow Hamilton cycles and lopsidependency ⋮ Probabilistic existence of regular combinatorial structures ⋮ Covering metric spaces by few trees ⋮ Some properties of non-bicolorable hypergraphs and the four-color problem ⋮ Bounded colorings of multipartite graphs and hypergraphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Chain method for panchromatic colorings of hypergraphs ⋮ On the stability of Baer subplanes ⋮ Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge ⋮ Maximal intersection critical families of finite sets ⋮ Bisecting and \(D\)-secting families for set systems ⋮ On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ Random constructions of hypergraphs with large girth and without panchromatic colorings ⋮ List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs ⋮ Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence ⋮ Erdős-Hajnal conjecture for graphs with bounded VC-dimension ⋮ Edge-partitioning 3-edge-connected graphs into paths ⋮ Mallows permutations and finite dependence ⋮ Strengthening hash families and compressive sensing ⋮ Long directed rainbow cycles and rainbow spanning trees ⋮ Colorings of \(b\)-simple hypergraphs

This page was built for publication: