Perfect graphs of fixed density: counting and homogeneous sets
type: Item
instance of: scholarly article
zbMATH Open document ID: 1248.05086
DOI: 10.1017/S0963548312000181
author: Julia Böttcher
author: Anusch Taraz
author: Andreas Würfl
published in: Combinatorics, Probability and Computing
publication date: 2012-09-12T00:00:00Z
full work available at URL: https://arxiv.org/abs/1102.5229
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C17
Mathematics Subject Classification ID: 05C42
zbMATH DE Number: 6081445
zbMATH Keywords: graph density
zbMATH Keywords: embedding induced subgraphs
MaRDI profile type: Publication
arXiv ID: 1102.5229
cites work: Almost all Berge Graphs are Perfect
cites work: Excluding Induced Subgraphs III: A General Asymptotic
cites work: The structure of hereditary properties and 2-coloured multigraphs
cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
cites work: The strong perfect graph theorem
cites work: The structure of hereditary properties and colourings of random graphs
cites work: On the structure of linear graphs
cites work: The number of graphs without forbidden subgraphs
cites work: Ramsey-type theorems
cites work: A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
cites work: Efficient testing of large graphs
cites work: The structure of almost all graphs in a hereditary property
cites work: On the entropy values of hereditary classes of graphs
cites work: Excluding induced subgraphs: quadrilaterals
title: Perfect graphs of fixed density: counting and homogeneous sets
description: scientific article; zbMATH DE number 6081445