Contents

-

A Turan-Type Problem on 3-Graphs Bing Zhou

Bing Zhou1
1Department of Mathematics University of Alberta Edmonton, Canada T6G 2G1

Abstract

In this paper, we study a problem related to one of the Turán problems: What is the maximum number of edges in a 3-graph without a complete subgraph on five vertices, the K5? We prove that the exact bound Turan conjectured is true if we forbid a larger class of subgraphs including K5.