The structure of hereditary properties and 2-coloured multigraphs

DOI10.1007/s00493-011-2630-7zbMath1249.05200MaRDI QIDQ653987

Edward Marchant, Andrew G. Thomason

Publication date: 20 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-011-2630-7

zbMATH Keywords

hereditary graph properties; extremal properties; 2-coloured multigraphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C80: Random graphs (graph-theoretic aspects)

05C75: Structural characterization of families of graphs

Related Items

Almost All Friendly Matrices Have Many Obstructions, Simple Containers for Simple Hypergraphs, The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours, Supersaturation for hereditary properties, Hypergraph containers, Perfect Graphs of Fixed Density: Counting and Homogeneous Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edit distance and its computation
• Extremal problems for directed graphs
• On the editing distance of graphs
• What is the furthest graph from a hereditary property?
• Algorithmic Solution of Extremal Digraph Problems
• On the entropy values of hereditary classes of graphs
• Projections of Bodies and Hereditary Properties of Hypergraphs
• The structure of hereditary properties and colourings of random graphs