scientific article; zbMATH DE number 970795
From MaRDI portal
Publication:5688999
zbMath0866.05030MaRDI QIDQ5688999
Béla Bollobás, Andrew G. Thomason
Publication date: 11 March 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Structured Codes of Graphs, Minimal reducible bounds for induced-hereditary properties, A remark on the number of edge colorings of graphs, Accumulation points of the edit distance function, Hereditary properties of partitions, ordered graphs and ordered hypergraphs, New results on word-representable graphs, Adjacency Labeling Schemes and Induced-Universal Graphs, Counting \(r\)-graphs without forbidden configurations, LP-based dual bounds for the maximum quasi-clique problem, Jumps in speeds of hereditary properties in finite relational languages, The edit distance function and symmetrization, Evolving Shelah‐Spencer graphs, Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers], Almost all string graphs are intersection graphs of plane convex sets, Locally bounded coverings and factorial properties of graphs, Axiomatic characterization of the toll walk function of some graph classes, A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs, Unnamed Item, The regularity of almost all edge ideals, The structure of almost all graphs in a hereditary property, Structure and enumeration theorems for hereditary properties in finite relational languages, The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours, Tournaments with near-linear transitive subsets, The structure of hereditary properties and 2-coloured multigraphs, On the structure of graphs with low obstacle number, \((k,l)\)-colourings and Ferrers diagram representations of cographs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, The maximum edit distance from hereditary graph properties, 𝑉𝐶_{ℓ}-dimension and the jump to the fastest speed of a hereditary ℒ-property, Induced Turán Numbers, Forbidding induced even cycles in a graph: typical structure and counting, Unnamed Item, The number of graphs with large forbidden subgraphs, The structure and the number of \(P_7\)-free bipartite graphs, Graphs with Large Obstacle Numbers, Measures on monotone properties of graphs, Theoretical aspects of equitable partition of networks into sparse modules, The structure and the number of \(P_7\)-free bipartite graphs, Robustness: a new form of heredity motivated by dynamic networks, Hereditary properties of hypergraphs, The unlabelled speed of a hereditary graph property, On the subgraph epimorphism problem, Unnamed Item, The number of graphs without forbidden subgraphs, Stability‐type results for hereditary properties, A note on counting orientations, A jump to the Bell number for hereditary graph properties, Forbidden induced partial orders, The speed of hereditary properties of graphs, Forcing large transitive subtournaments, Hereditary classes of graphs: a parametric approach, EH-suprema of tournaments with no nontrivial homogeneous sets, Almost all string graphs are intersection graphs of plane convex sets, The number of 2-SAT functions
