Graphs which contain all small graphs
From MaRDI portal
Publication:1157341
DOI10.1016/S0195-6698(81)80015-7zbMath0471.05037MaRDI QIDQ1157341
Béla Bollobás, Andrew G. Thomason
Publication date: 1981
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(81)80015-7
05C35: Extremal problems in graph theory
Related Items
Ramsey properties of orientations of graphs, Adjacency Labeling Schemes and Induced-Universal Graphs, Induced Universal Hypergraphs, Quasi-Random Set Systems, Infinite Paley graphs, Triply Existentially Complete Triangle‐Free Graphs, Isometric Universal Graphs, A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth, Graphs defined on groups, One-dimensional asymptotic classes of finite structures, Quasi-random graphs, On the Weisfeiler-Leman dimension of fractional packing, Random strongly regular graphs?, Random strongly regular graphs?, Asymptotically optimal induced universal graphs, Vector representations of graphs, A construction for Ramsey numbers for \(K_{m,n}\), Random constructions and density results, The number of submatrices of a given type in a Hadamard matrix and related results, Constructions of large arcs and blocking sets in finite planes, Quasi-random subsets of \(\mathbb{Z}_ n\), Not all graphs are segment \(T\)-graphs, The star arboricity of graphs, Approximately strongly regular graphs, Ample simplicial complexes, Spectral symmetry in conference matrices, Universal arrays, A survey of homogeneous structures, Further results on existentially closed graphs arising from block designs, Disjoint induced subgraphs of the same order and size, Graphs with the \(n\)-e.c. adjacency property constructed from affine planes, Tournaments and Semicomplete Digraphs, Quasi-random tournaments, Quasi-random hypergraphs, Graphs with then-e.c. adjacency property constructed from resolvable designs
Cites Work
