The speed of hereditary properties of graphs
From MaRDI portal
Publication:1850473
DOI10.1006/jctb.2000.1952zbMath1026.05062OpenAlexW2125792811MaRDI QIDQ1850473
David Weinreich, Béla Bollobás, József Balogh
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2000.1952
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Graph theory (05C99)
Related Items
On the Tutte and Matching Polynomials for Complete Graphs, Hereditary properties of partitions, ordered graphs and ordered hypergraphs, New results on word-representable graphs, Graph parameters, implicit representations and factorial properties, Jumps in speeds of hereditary properties in finite relational languages, Classes of graphs without star forests and related graphs, On estimation of the number of graphs in some hereditary classes, Bichain graphs: geometric model and universal graphs, Locally bounded coverings and factorial properties of graphs, Critical properties of bipartite permutation graphs, A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs, Logical labeling schemes, The structure of almost all graphs in a hereditary property, Shadows of ordered graphs, Structure and enumeration theorems for hereditary properties in finite relational languages, On factorial properties of chordal bipartite graphs, Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number, Embedding dualities for set partitions and for relational structures, Implicit representations and factorial properties of graphs, On the speed of algebraically defined graph classes, The maximum edit distance from hereditary graph properties, 𝑉𝐶_{ℓ}-dimension and the jump to the fastest speed of a hereditary ℒ-property, Induced Turán Numbers, Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties, Between 2- and 3-colorability, Stable-\(\Pi\) partitions of graphs, The penultimate rate of growth for graph properties, Definability of Combinatorial Functions and Their Linear Recurrence Relations, Boundary properties of graphs for algorithmic graph problems, Growth constants of minor-closed classes of graphs, Graph parameters, implicit representations and factorial properties, The structure and the number of \(P_7\)-free bipartite graphs, Measures on monotone properties of graphs, The structure and the number of \(P_7\)-free bipartite graphs, Deciding the Bell Number for Hereditary Graph Properties, Excluding induced subgraphs: Critical graphs, The unlabelled speed of a hereditary graph property, Combinatorics and algorithms for quasi-chain graphs, Graph functionality, Combinatorics and algorithms for quasi-chain graphs, Boundary Properties of Factorial Classes of Graphs, The number of graphs without forbidden subgraphs, Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings, A counter-example to the probabilistic universal graph conjecture via randomized communication complexity, A jump to the Bell number for hereditary graph properties, Parameterized complexity of the maximum independent set problem and the speed of hereditary properties, Efficient Local Representations of Graphs, Hereditary classes of graphs: a parametric approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Excluding induced subgraphs. II: Extremal graphs
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- On the size of hereditary classes of graphs
- Excluding induced subgraphs: quadrilaterals
- Excluding Induced Subgraphs III: A General Asymptotic
- On the entropy values of hereditary classes of graphs
- On the Structure of Edge Graphs
- Generalized chromatic numbers of random graphs
- Projections of Bodies and Hereditary Properties of Hypergraphs
