Projections of Bodies and Hereditary Properties of Hypergraphs
From MaRDI portal
Publication:4863823
DOI10.1112/blms/27.5.417zbMath0836.05072OpenAlexW2021161286MaRDI QIDQ4863823
Béla Bollobás, Andrew G. Thomason
Publication date: 22 February 1996
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/blms/27.5.417
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30) Extremal set theory (05D05) Length, area, volume, other geometric measure theory (28A75) Length, area and volume in real or complex geometry (51M25) Inequalities and extremum problems in real or complex geometry (51M16)
Related Items
On multiplicative energy of subsets of varieties, Structured Codes of Graphs, Orthogonal projections of discretized sets, A proof of a Loomis-Whitney type inequality via optimal transport, Entropy and set cardinality inequalities for partition-determined functions, Hereditary properties of partitions, ordered graphs and ordered hypergraphs, The dual Loomis–Whitney inequality, Uniform cover inequalities for the volume of coordinate sections and projections of convex bodies, New results on word-representable graphs, Jumps in speeds of hereditary properties in finite relational languages, On the average volume of sections of convex bodies, Rectilinear approximation and volume estimates for hereditary bodies via [0, 1‐decorated containers], On a problem of Erdős and Moser, Almost all string graphs are intersection graphs of plane convex sets, Supersaturation for hereditary properties, Locally bounded coverings and factorial properties of graphs, Sharp isoperimetric inequalities for affine quermassintegrals, On a topological version of Pach's overlap theorem, A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs, The structure of almost all graphs in a hereditary property, Computing from projections of random points, Shadows of ordered graphs, Almost all triple systems with independent neighborhoods are semi-bipartite, Structure and enumeration theorems for hereditary properties in finite relational languages, On factorial properties of chordal bipartite graphs, On the Inequalities of Projected Volumes and the Constructible Region, Projections, entropy and sumsets, Almost all triangle-free triple systems are tripartite, A superadditivity and submultiplicativity property for cardinalities of sumsets, The structure of hereditary properties and 2-coloured multigraphs, Reverse Brascamp-Lieb inequality and the dual Bollobás-Thomason inequality, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, The maximum edit distance from hereditary graph properties, The complex L_p Loomis-Whitney inequality, 𝑉𝐶_{ℓ}-dimension and the jump to the fastest speed of a hereditary ℒ-property, The typical structure of graphs with no large cliques, The penultimate rate of growth for graph properties, Definability of Combinatorial Functions and Their Linear Recurrence Relations, The cardinality of sumsets: different summands, The number of graphs with large forbidden subgraphs, Estimates of Loomis-Whitney type for intrinsic volumes, The structure and the number of \(P_7\)-free bipartite graphs, Measures on monotone properties of graphs, On the reverse Loomis-Whitney inequality, Sumsets and entropy, The structure and the number of \(P_7\)-free bipartite graphs, Excluding induced subgraphs: Critical graphs, Hereditary properties of hypergraphs, The unlabelled speed of a hereditary graph property, Energies and structure of additive sets, Projections of antichains, Geometric stability via information theory, Boundary Properties of Factorial Classes of Graphs, Rogers-Shephard and local Loomis-Whitney type inequalities, The number of graphs without forbidden subgraphs, On affine invariant and local Loomis–Whitney type inequalities, Inequalities on Projected Volumes, The speed of hereditary properties of graphs, Duality and Optimality of Auctions for Uniform Distributions, Hereditary classes of graphs: a parametric approach, Almost all string graphs are intersection graphs of plane convex sets, The \(L_p\) Loomis-Whitney inequality, The number of 2-SAT functions
