scientific article; zbMATH DE number 3557819
From MaRDI portal
Publication:4133658
zbMath0358.05027MaRDI QIDQ4133658
Bruce L. Rothschild, Daniel J. Kleitman, Paul Erdős
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Structured Codes of Graphs, A remark on the number of edge colorings of graphs, The number of \(C_{2\ell}\)-free graphs, Counting unlabeled structures, Integer colorings with no rainbow 3-term arithmetic progression, The number of hypergraphs without linear cycles, Distance Ramsey numbers, Eternal domination and clique covering, The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph, Counting H-free orientations of graphs, An intersection theorem for four sets, Hereditary properties of partitions, ordered graphs and ordered hypergraphs, On Ramsey numbers of uniform hypergraphs with given maximum degree, Counting \(r\)-graphs without forbidden configurations, On the maximum number of integer colourings with forbidden monochromatic sums, Bounds on the number of 2-level polytopes, cones, and configurations, New bounds for the distance Ramsey number, Classes of graphs without star forests and related graphs, Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers], The number of maximal independent sets in the Hamming cube, The exponential growth of the packing chromatic number of iterated Mycielskians, Almost all string graphs are intersection graphs of plane convex sets, Lower tails via relative entropy, The asymptotic distribution of short cycles in random regular graphs, Random ℓ‐colourable structures with a pregeometry, Supersaturation for hereditary properties, Locally bounded coverings and factorial properties of graphs, Triangle-free graphs with the maximum number of cycles, Near-domination in graphs, Intersecting families of sets are typically trivial, The almost sure theory of finite metric spaces, The regularity of almost all edge ideals, On hypergraphs without loose cycles, The structure of almost all graphs in a hereditary property, On an extremal problem for locally sparse multigraphs, Shadows of ordered graphs, Almost all triple systems with independent neighborhoods are semi-bipartite, Simple Containers for Simple Hypergraphs, Critical graphs without triangles: an optimum density construction, The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours, Extremal Theory of Locally Sparse Multigraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Hypergraph containers, The age of a relational structure, Forbidding induced even cycles in a graph: typical structure and counting, On the structure of oriented graphs and digraphs with forbidden tournaments or cycles, Ensemble equivalence for dense graphs, Intersecting families of discrete structures are typically trivial, The number of graphs with large forbidden subgraphs, The structure and the number of \(P_7\)-free bipartite graphs, The typical structure of sparse $K_{r+1}$-free graphs, The structure and the number of \(P_7\)-free bipartite graphs, On a cycle partition problem, Deciding the Bell Number for Hereditary Graph Properties, Hereditary properties of hypergraphs, DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS, On the typical structure of graphs in a monotone property, An Extremal Graph Problem with a Transcendental Solution, An efficient container lemma, Ramsey-type theorems, Estimating parameters associated with monotone properties, On pro-\(p\) groups with quadratic cohomology, Independent sets in hypergraphs, Structure and stability of triangle-free set systems, Kneser Colorings of Uniform Hypergraphs, Hereditary classes of graphs: a parametric approach, Almost all string graphs are intersection graphs of plane convex sets, The number of 2-SAT functions
