scientific article
From MaRDI portal
zbMath0315.05117MaRDI QIDQ4074927
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Problem books (00A07) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items
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, Panchromatic 3-coloring of a random hypergraph, A note on panchromatic colorings, Panchromatic 3-colorings of random hypergraphs, DP-colorings of hypergraphs, Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms, Cooperative colorings of forests, Concepts on coloring of cluster hypergraphs with application, 2-colorings of hypergraphs with large girth, Expander spanning subgraphs with large girth, Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022, Moser-Tardos resampling algorithm, entropy compression method and the subset gas, Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs, The lonely runner problem for lacunary sequences, On cycle systems with specified weak chromatic number, Random bipartite posets and extremal problems, Random hypergraphs and property B, Blowup Ramsey numbers, Choosability of graphs with infinite sets of forbidden differences, The Lovász local lemma and variable strength covering arrays, Towards the linear arboricity conjecture, A note on a series of families constructed over the cyclic graph, Weighted dependency graphs, The Cayley isomorphism property for Cayley maps, Coloring cross-intersecting families, Panchromatic colorings of random hypergraphs, Assouad's theorem with dimension independent of the snowflaking, Generalizations of the Kolmogorov-Barzdin embedding estimates, Polychromatic colorings and cover decompositions of hypergraphs, Reliable communication over highly connected noisy networks, Testing hypergraph colorability, Entropy compression versus Lovász local lemma, A note on kernels of intersecting families, 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs, Injective edge-coloring of graphs with given maximum degree, Recognizing binary shuffle squares is \textsf{NP}-hard, Coloring \(d\)-embeddable \(k\)-uniform hypergraphs, Fast winning strategies in maker-breaker games, Directed Lovász local lemma and Shearer's lemma, Coloring graphs without bichromatic cycles or paths, Randomized construction of complexes with large diameter, Coloring hypergraphs with bounded cardinalities of edge intersections, Acyclic coloring of graphs and entropy compression method, Variations on twins in permutations, Ergodic theorems for the shift action and pointwise versions of the Abért-Weiss theorem, Maximal intersecting families and affine regular polygons in \(PG(2,q)\), Train tracks with gaps: applying the probabilistic method to trains, Graphs with a small number of distinct induced subgraphs, Minimum number of elements of representing a set system of given rank, Small simplicial complexes with prescribed torsion in homology, The star arboricity of graphs, When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence, Edge weights and vertex colours, Measurable versions of the Lovász local lemma and measurable graph colorings, 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, Variations on a game, Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings, On Erdős-Rado numbers, New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\), Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma, Blocking sets of certain line sets related to a hyperbolic quadric in \(\mathrm{PG}(3, q)\), Injective edge-coloring of graphs with small weight, On defining sets for projective planes, On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method, \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs, From one to many rainbow Hamiltonian cycles, Around Erdős-Lovász problem on colorings of non-uniform hypergraphs, On coupon colorings of graphs, High girth hypergraphs with unavoidable monochromatic or rainbow edges, The local cut lemma, On a combinatorial framework for fault characterization, Inequalities for minimal covering sets in set systems of given rank, Tight multiple twins in permutations, More on maximal intersecting families of finite sets, Hypergraphs with high chromatic number, An \(O(n\log n)\) algorithm for finding dissimilar strings, Separation dimension of graphs and hypergraphs, Probabilistic methods, Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\), The list chromatic number of graphs with small clique number, From Erdős to algorithms, Cycles of length 0 modulo k in directed graphs, Covering with Latin transversals, A new construction of non-extendable intersecting families of sets, Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking, Coloring and the Lovász local lemma, Unsplittable coverings in the plane, A bound on the strong chromatic index of a graph, Extremal problems for colorings of simple hypergraphs and applications, Equitable colorings of non-uniform simple hypergraphs, Fractional v. integral covers in hypergraphs of bounded edge size, Equitable colorings of nonuniform hypergraphs, 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, Sets of permutations that generate the symmetric group pairwise., Codes identifying sets of vertices in random networks, The linear arboricity of graphs, Four results about self-blocking clutters, Generalised acyclic edge colourings of graphs with large girth, Van der Waerden function and colorings of hypergraphs with large girth, Independent dominating sets and a second hamiltonian cycle in regular graphs, Dimension reduction for finite trees in \(\ell_1\), Coloring 2-intersecting hypergraphs, On 3-chromatic hypergraphs, On the dynamic coloring of graphs, A new lower bound for van der Waerden numbers, On the stability of small blocking sets, A degree version of the Hilton-Milner theorem, On maximal intersecting families of finite sets, Improved algorithms for colorings of simple hypergraphs and applications, Improved bounds on coloring of graphs, Some new bounds on partition critical hypergraphs, Bounded size components -- partitions and transversals., Ramsey numbers involving large dense graphs and bipartite Turán numbers, On positional games, A remark concerning arithmetic progressions, Selective hypergraph colourings, The adjacent vertex distinguishing total chromatic number, Frugal, acyclic and star colourings of graphs, Shearer's measure and stochastic domination of product measures, Randomly colouring graphs (a combinatorial view), Equitable two-colorings of uniform hypergraphs, Colouring graphs when the number of colours is almost the maximum degree, Reroute sequence planning in telecommunication networks and compact vector summation., On \(r\)-chromatic hypergraphs, Polynomial treewidth forces a large grid-like-minor, A sensor-based framework for kinetic data compression, Independent sets in regular graphs and sum-free subsets of finite groups, Blocking sets of the classical unital, Unavoidable subgraphs of colored graphs, Relative blocking sets of unions of Baer subplanes, Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors, On weak odd domination and graph-based quantum secret sharing, An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\), Orientations making \(k\)-cycles cyclic, Hölder-type inequalities and their applications to concentration and correlation bounds, An estimate for the probability of dependent events, A Kolmogorov complexity proof of the Lovász local lemma for satisfiability, Edge colouring by total labellings, Acyclic improper colourings of graphs with bounded maximum degree, Color-blind index in graphs of very low degree, Asymptotically optimal frugal colouring, Backbone colorings of graphs with bounded degree, On-line algorithms for 2-coloring hypergraphs via chip games, Dynamic chromatic number of regular graphs, On a combinatorial problem of P. Erdős and L. Lovasz, On a cycle partition problem, Invitation to intersection problems for finite sets, Coloring non-uniform hypergraphs without short cycles, Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas, Finding occurrences of protein complexes in protein-protein interaction graphs, On codes with the identifiable parent property, Lopsided Lovász Local lemma and Latin transversals, The triangle-free process, \(l\)-trace \(k\)-Sperner families of sets, \(k\)-independent percolation on trees, Vertices of small degree in uniquely Hamiltonian graphs, On the cover Ramsey number of Berge hypergraphs, The hat guessing number of graphs, Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration, On a graph colouring problem, Linear coloring of graphs, Perfect hash families: Probabilistic methods and explicit constructions, A strengthening of Brooks' theorem, Asymptotic behavior of the chromatic index for hypergraphs, Critical hypergraphs and interesting set-pair systems, Probabilistic methods in coloring and decomposition problems, Acyclic edge-colorings of sparse graphs
