scientific article; zbMATH DE number 3557819

MaRDI QIDQ4133658zbMATH OpenFDO

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

Publication date 1976

Mathematics Subject Classification ID

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

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

Cited in

(74)

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

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)