Turán and Ramsey Properties of Subcube Intersection Graphs

DOI10.1017/S0963548312000429zbMath1257.05094arXiv1110.4283MaRDI QIDQ4903262

J. Robert Johnson, Klas Markström

Publication date: 21 January 2013

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

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

zbMATH Keywords

Ramsey-type problemTurán-type problemvertex graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Generalized Ramsey theory (05C55) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Random subcube intersection graphs. I: Cliques and covering ⋮ Biclique covers and partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Intersection patterns of convex sets
• Supersaturated graphs and hypergraphs
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• The early evolution of the \(H\)-free process
• On covering graphs by complete bipartite subgraphs
• On a packing and covering problem
• Intersection properties of boxes. I: An upper-bound theorem
• A note on Ramsey numbers
• Asymptotic lower bounds for Ramsey functions
• Voting in Agreeable Societies
• The number of cliques in graphs of given order and size
• On Random Intersection Graphs: The Subgraph Problem
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The Representation of a Graph by Set Intersections

This page was built for publication: Turán and Ramsey Properties of Subcube Intersection Graphs