K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
From MaRDI portal
Publication:3781776
DOI10.2307/2000689zbMath0641.05025OpenAlexW4238030752MaRDI QIDQ3781776
Bruce L. Rothschild, Hans Jürgen Prömel, Phokion G. Kolaitis
Publication date: 1987
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2000689
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Model theory of finite structures (03C13)
Related Items
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent ⋮ The number of \(C_{2\ell}\)-free graphs ⋮ Counting unlabeled structures ⋮ Hereditary properties of partitions, ordered graphs and ordered hypergraphs ⋮ Homogenizable structures and model completeness ⋮ Extremal Graph Problems for Graphs with a Color-Critical Vertex ⋮ Almost all Berge Graphs are Perfect ⋮ Classes of graphs without star forests and related graphs ⋮ Random ℓ‐colourable structures with a pregeometry ⋮ Locally bounded coverings and factorial properties of graphs ⋮ Hypergraphs with many Kneser colorings ⋮ Zero-one \(k\)-law ⋮ On tension-continuous mappings ⋮ The almost sure theory of finite metric spaces ⋮ The structure of almost all graphs in a hereditary property ⋮ Almost all triple systems with independent neighborhoods are semi-bipartite ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours ⋮ Almost all triangle-free triple systems are tripartite ⋮ Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination ⋮ The number of \(K_{m,m}\)-free graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On Colourings of Hypergraphs Without Monochromatic Fano Planes ⋮ Logical limit laws for minor-closed classes of graphs ⋮ Infinitary logics and 0-1 laws ⋮ Forbidding induced even cycles in a graph: typical structure and counting ⋮ On the structure of oriented graphs and digraphs with forbidden tournaments or cycles ⋮ On the structure of clique-free graphs ⋮ Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs ⋮ Submaps of maps. I: General 0-1 laws ⋮ Counting sum-free sets in abelian groups ⋮ Uncountable graphs and invariant measures on the set of universal countable graphs ⋮ 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 ⋮ The first order convergence law fails for random perfect graphs ⋮ Deciding the Bell Number for Hereditary Graph Properties ⋮ Excluding induced subgraphs: Critical graphs ⋮ DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS ⋮ An efficient container lemma ⋮ Diameter of io-decomposable Riordan graphs of the Bell type ⋮ Boundary Properties of Factorial Classes of Graphs ⋮ Asymptotic probabilities of extension properties and random \(l\)-colourable structures ⋮ The number of graphs without forbidden subgraphs ⋮ Large cliques and independent sets all over the place ⋮ Limit laws and automorphism groups of random nonrigid structures ⋮ An expected polynomial time algorithm for coloring 2-colorable 3-graphs ⋮ Hereditary classes of graphs: a parametric approach ⋮ Counting independent sets in graphs ⋮ Simple structures axiomatized by almost sure theories
