Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Extremal Problems Transformations of
 

Summary: Extremal Problems
Concerning
Transformations of
the Edges of the
Complete Hypergraphs
Yair Car0
SCHOOL OF MATHMAT/CS
UNlVERSITY OF T fL-AVIV
RAM AT-AV/V; TEL-AVIV, ISRAEL
ABSTRACT
We consider extremal problems concerning transformations of the
edges of complete hypergraphs. We estimate the order of the largest
subhypergraph K such that for every edge e E (K),f(e)e f ( K ) ,assum-
ing f(e)# e. Several extensions and variations of this problem are also
discussed here.
INTRODUCTION
In this paper we investigate some extremal problems concerning transforma-
tions of the n-subsets of a set.' We begin with some technical definitions.
For a set S, let IS1 denote its cardinality. For a graph G, let V(G)[respec-
tively, E(G)]denote the vertex set (respectively, edge set) of G, and let e(G) =

  

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University

 

Collections: Mathematics