Measures on monotone properties of graphs
نویسندگان
چکیده
Given a monotone property P of graphs, write Pn for the set of graphs with vertex set [n] having property P. Building on recent results in the enumeration of graphical properties, we prove numerous results about the structure of graphs in Pn and the functions |Pn|. We also examine the measure eP (n), the maximum number of edges in a graph of Pn.
منابع مشابه
Complexes of Directed Graphs 3 2
Let P be a monotone property of directed graphs on n vertices, and let P n denote the abstract simplicial complex whose simplices are the edge sets of graphs having property P. We prove that: 1. If \P = acyclic" then P n is homotopy equivalent to the (n ? 2)-sphere. 2. If \P = not strongly connected" then P n has the homotopy type of a wedge of (n ? 1)! spheres of dimension 2n ? 4. The lattice ...
متن کاملOn Burr III-Inverse Weibull Distribution with COVID-19 Applications
We introduce a flexible lifetime distribution called Burr III-Inverse Weibull (BIII-IW). The new proposed distribution has well-known sub-models. The BIII-IW density function includes exponential, left-skewed, right-skewed and symmetrical shapes. The BIII-IW model’s failure rate can be monotone and non-monotone depending on the parameter values. To show the importance of the BIII-IW distributio...
متن کاملDistance monotonicity and a new characterization of hypercubes
In this paper, we are interested in some metric properties of graphs. In particular, we investigate distance monotonicity in graphs. Straightaway, we revisit the notion of distance monotonicity. We then introduce interval distance monotone graphs, graphs which are not distance monotone but whose intervals are distance monotone. Finally, we obtain a new characterization of hypercubes involving t...
متن کاملOn the Typical Structure of Graphs in a Monotone Property
Given a graph property P, it is interesting to determine the typical structure of graphs that satisfy P. In this paper, we consider monotone properties, that is, properties that are closed under taking subgraphs. Using results from the theory of graph limits, we show that if P is a monotone property and r is the largest integer for which every r-colorable graph satis es P, then almost every gra...
متن کاملCOSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 116 شماره
صفحات -
تاریخ انتشار 2002