The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours

DOI10.1017/S0963548317000293zbMath1373.05093arXiv1608.08990OpenAlexW2964140566MaRDI QIDQ5373834

Peter Keevash, William Lochet

Publication date: 27 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.08990

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraph containers
• The structure of almost all graphs in a hereditary property
• The structure of hereditary properties and 2-coloured multigraphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The typical structure of sparse $K_{r+1}$-free graphs
• The typical structure of graphs without given excluded subgraphs
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Excluding induced subgraphs: quadrilaterals
• Excluding Induced Subgraphs III: A General Asymptotic
• On the entropy values of hereditary classes of graphs
• Independent sets in hypergraphs
• On the structure of linear graphs
• The structure of hereditary properties and colourings of random graphs

This page was built for publication: The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours