DeepAI AI Chat
Log In Sign Up

Common Pairs of Graphs

by   Natalie Behague, et al.

A graph H is said to be common if the number of monochromatic labelled copies of H in a red/blue edge colouring of a large complete graph is asymptotically minimized by a random colouring with an equal proportion of each colour. We extend this notion to an asymmetric setting. That is, we define a pair (H_1,H_2) of graphs to be (p,1-p)-common if a particular linear combination of the density of H_1 in red and H_2 in blue is asymptotically minimized by a random colouring in which each edge is coloured red with probability p and blue with probability 1-p. We extend many of the results on common graphs to this asymmetric setting. In addition, we obtain several novel results for common pairs of graphs with no natural analogue in the symmetric setting. We also obtain new examples of common graphs in the classical sense and propose several open problems.


page 1

page 2

page 3

page 4


Minimal Ordered Ramsey Graphs

An ordered graph is a graph equipped with a linear ordering of its verte...

Best-of-Three Voting on Dense Graphs

Given a graph G of n vertices, where each vertex is initially attached a...

A General Dependency Structure for Random Graphs and Its Effect on Monotone Properties

We consider random graphs in which the edges are allowed to be dependent...

Majority Model on Random Regular Graphs

Consider a graph G=(V,E) and an initial random coloring where each verte...

Edge and Pair Queries – Random Graphs and Complexity

We investigate two types of query games played on a graph, pair queries ...

Universal Approximation of Edge Density in Large Graphs

In this paper, we present a novel way to summarize the structure of larg...

Equitable Partitions into Matchings and Coverings in Mixed Graphs

Matchings and coverings are central topics in graph theory. The close re...