The structure of hereditary properties and 2-coloured multigraphs
From MaRDI portal
Publication:653987
DOI10.1007/S00493-011-2630-7zbMATH Open1249.05200OpenAlexW1993010909MaRDI QIDQ653987FDOQ653987
Authors: Edward Marchant, Andrew 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
Recommendations
- Largest subgraph from a hereditary property in a random graph
- The structure of almost all graphs in a hereditary property
- On generalized graph colorings
- Generalized Chromatic Numbers of Random Graphs
- scientific article; zbMATH DE number 4063145
- Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
- The structure of hereditary properties and colourings of random graphs
- Generalized chromatic numbers of random graphs
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)
Cites Work
- Projections of Bodies and Hereditary Properties of Hypergraphs
- Title not available (Why is that?)
- Edit distance and its computation
- Extremal graphs and multigraphs with two weighted colours
- On the editing distance of graphs
- What is the furthest graph from a hereditary property?
- On the entropy values of hereditary classes of graphs
- The structure of hereditary properties and colourings of random graphs
- Algorithmic Solution of Extremal Digraph Problems
- Extremal problems for directed graphs
- Title not available (Why is that?)
Cited In (10)
- Graphs, colours, weights and hereditary properties
- Non-proper edge-colouring of graphs and hereditary graph properties
- Supersaturation for hereditary properties
- The structure of hereditary properties and colourings of random graphs
- Hypergraph containers
- The structure of typical eye-free graphs and a Turán-type result for two weighted colours
- Title not available (Why is that?)
- Almost all friendly matrices have many obstructions
- Simple containers for simple hypergraphs
- Perfect graphs of fixed density: counting and homogeneous sets
This page was built for publication: The structure of hereditary properties and 2-coloured multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653987)