z-logo
Premium
Extremal problems concerning transformations of the edges of the complete hypergraphs
Author(s) -
Caro Yair
Publication year - 1987
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190110106
Subject(s) - mathematics , combinatorics , order (exchange) , enhanced data rates for gsm evolution , discrete mathematics , computer science , telecommunications , finance , economics
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(K) , assuming f(e) ≠ e . Several extensions and variations of this problem are also discussed here.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here