64 research outputs found
The Friendship Theorem
In this article we prove the friendship theorem according to the article [1], which states that if a group of people has the property that any pair of persons have exactly one common friend, then there is a universal friend, i.e. a person who is a friend of every other person in the group.This work has been supported by the Polish Ministry of Science and Higher Education project “Managing a Large Repository of Computer-verified Mathematical Knowledge” (N N519 385136)Institute of Informatics, University of Białystok, PolandMichael Albert. Notes on the friendship theorem, http://www.math.auckland.ac.nz/-~olympiad/training/2006/friendship.pdf.Grzegorz Bancerek. Cardinal arithmetics. Formalized Mathematics, 1(3):543-547, 1990.Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.Czesław Bylinski. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.Czesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.Czesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.Jarosław Kotowicz. Functions and finite sequences of real numbers. Formalized Mathematics, 3(2):275-278, 1992.Rafał Kwiatek. Factorial and Newton coefficients. Formalized Mathematics, 1(5):887-890, 1990.Rafał Kwiatek and Grzegorz Zwara. The divisibility of integers and integer relative primes. Formalized Mathematics, 1(5):829-832, 1990.Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.Edmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85-89, 1990
Interlace Polynomials of Friendship Graphs
In this paper, we study the interlace polynomials of friendship graphs, that is, graphs that satisfy the Friendship Theorem given by Erdös, Rényi and Sos. Explicit formulas, special values and behavior of coefficients of these polynomials are provided. We also give the interlace polynomials of other similar graphs, such as, the butterfly graph
Bounding the Number of Hyperedges in Friendship -Hypergraphs
For , an -uniform hypergraph is called a friendship
-hypergraph if every set of vertices has a unique 'friend' - that
is, there exists a unique vertex with the property that for each
subset of size , the set is a hyperedge.
We show that for , the number of hyperedges in a friendship
-hypergraph is at least , and we
characterise those hypergraphs which achieve this bound. This generalises a
result given by Li and van Rees in the case when .
We also obtain a new upper bound on the number of hyperedges in a friendship
-hypergraph, which improves on a known bound given by Li, van Rees, Seo and
Singhi when .Comment: 14 page
- …