scientific article; zbMATH DE number 3557819

zbMATH Open0358.05027MaRDI QIDQ4133658FDOQ4133658

Authors: Bruce Rothschild, Daniel J. Kleitman, P. Erdős 

Publication date: 1976

Title of this publication is not available (Why is that?)

Recommendations

• The number of \(K_{s,t}\)-free graphs
• The number of \(K_{m,m}\)-free graphs
• scientific article; zbMATH DE number 3931048
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• On the number of graphs without large cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cited In (74)

• An Extremal Graph Problem with a Transcendental Solution
• Intersecting families of sets are typically trivial
• Estimating parameters associated with monotone properties
• The structure of typical eye-free graphs and a Turán-type result for two weighted colours
• Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers
• The exponential growth of the packing chromatic number of iterated Mycielskians
• The regularity of almost all edge ideals
• Bounds on the number of 2-level polytopes, cones, and configurations
• On the typical structure of graphs not containing a fixed vertex-critical subgraph
• On an extremal problem for locally sparse multigraphs
• Lower tails via relative entropy
• New bounds for the distance Ramsey number
• Locally bounded coverings and factorial properties of graphs
• Discrete metric spaces: structure, enumeration, and 0-1 laws
• Counting unlabeled structures
• Counting H-free orientations of graphs
• Supersaturation for hereditary properties
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Classes of graphs without star forests and related graphs
• Hereditary classes of graphs: a parametric approach
• Independent sets in hypergraphs
• The structure of almost all graphs in a hereditary property
• On a cycle partition problem
• The number of graphs with large forbidden subgraphs
• Structured Codes of Graphs
• Hypergraph containers
• An efficient container lemma
• On the number of graphs without large cliques
• Hereditary properties of hypergraphs
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• Shadows of ordered graphs
• The number of \(C_{2\ell}\)-free graphs
• Ensemble equivalence for dense graphs
• The structure and the number of \(P_7\)-free bipartite graphs
• The structure and the number of \(P_7\)-free bipartite graphs
• The number of hypergraphs without linear cycles
• On hypergraphs without loose cycles
• The number of \(K_{m,m}\)-free graphs
• Random \(\ell\)-colourable structures with a pregeometry
• Integer colorings with no rainbow 3-term arithmetic progression
• Counting \(H\)-free graphs
• On the typical structure of graphs in a monotone property
• The typical structure of sparse \(K_{r+1}\)-free graphs
• The number of maximal independent sets in the Hamming cube
• The number of 2-SAT functions
• Triangle-free graphs with the maximum number of cycles
• Ramsey-type theorems
• The number of \(K_{s,t}\)-free graphs
• Kneser colorings of uniform hypergraphs
• Counting \(r\)-graphs without forbidden configurations
• Structure and stability of triangle-free set systems
• The probability of non-existence of a subgraph in a moderately sparse random graph
• Eternal domination and clique covering
• Deciding the Bell number for hereditary graph properties
• Extremal theory of locally sparse multigraphs
• The age of a relational structure
• Almost all string graphs are intersection graphs of plane convex sets
• On the maximum number of integer colourings with forbidden monochromatic sums
• Hereditary properties of partitions, ordered graphs and ordered hypergraphs
• Asymptotic enumeration and a 0-1 law for $m$-clique free graphs
• The almost sure theory of finite metric spaces
• Simple containers for simple hypergraphs
• Critical graphs without triangles: an optimum density construction
• Almost all triple systems with independent neighborhoods are semi-bipartite
• Forbidding induced even cycles in a graph: typical structure and counting
• Distance Ramsey numbers
• The asymptotic distribution of short cycles in random regular graphs
• On the structure of oriented graphs and digraphs with forbidden tournaments or cycles
• Intersecting families of discrete structures are typically trivial
• A remark on the number of edge colorings of graphs
• Almost all string graphs are intersection graphs of plane convex sets
• Near-domination in graphs
• An intersection theorem for four sets
• On pro-\(p\) groups with quadratic cohomology

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 Q4133658)