Displaying similar documents to “Erdös-Ko-Rado from intersecting shadows”

Spaces of ω-limit sets of graph maps

Jie-Hua Mai, Song Shao (2007)

Fundamenta Mathematicae

Similarity:

Let (X,f) be a dynamical system. In general the set of all ω-limit sets of f is not closed in the hyperspace of closed subsets of X. In this paper we study the case when X is a graph, and show that the family of ω-limit sets of a graph map is closed with respect to the Hausdorff metric.

On a generalization of the friendship theorem

Mohammad Hailat (2012)

Discussiones Mathematicae Graph Theory

Similarity:

The Friendship Theorem states that if any two people, of a group of at least three people, have exactly one friend in common, then there is always a person who is everybody's friend. In this paper, we generalize the Friendship Theorem to the case that in a group of at least three people, if every two friends have one or two common friends and every pair of strangers have exactly one friend then there exist one person who is friend to everybody in the group. In particular, we show that...

Pₘ-saturated bipartite graphs with minimum size

Aneta Dudek, A. Paweł Wojda (2004)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and adding any new edge to G creates a copy of H in G. In 1986 L. Kászonyi and Zs. Tuza considered the following problem: for given m and n find the minimum size sat(n;Pₘ) of Pₘ-saturated graph of order n. They gave the number sat(n;Pₘ) for n big enough. We deal with similar problem for bipartite graphs.