Exact solution of some Turán-type problems
نویسندگان
چکیده
Fifteen years ago Chvatal conjectured that if 9 is a family of k subsets of an nset, 191 > (;I;), d is an arbitrary integer with d< k 1 and (d+ 1) k n,(k). in a more general framework. Another problem which is solved asymptotically is when the excluded configuration is a tixed sunflower. ( 1987 Academtc Press, Inc.
منابع مشابه
1 - Introduction to hypergraphs
We begin with an introduction to hypergraphs, which gives a taste of different representations of hypergraphs, linear hypergraphs, and Turán-type problems, including existence of Turán densities and classification of zero Turán densities. Thereafter we delve deeper into some of the classical theorems of hypergraph theory, including various theorems on intersecting families such as Sperner’s The...
متن کاملTriple Systems Not Containing a Fano Configuration
Given a 3-uniform hypergraph F , let ex3(n,F) denote the maximum possible size of a 3-uniform hypergraph of order n that does not contain any subhypergraph isomorphic to F . Our terminology follows that of [16] and [10], which are comprehensive survey articles of Turán-type extremal graph and hypergraph problems, respectively. Also see the monograph of Bollobás [2]. There is an extensive litera...
متن کاملNumerical solution of variational problems via Haar wavelet quasilinearization technique
In this paper, a numerical solution based on Haar wavelet quasilinearization (HWQ) is used for finding the solution of nonlinear Euler-Lagrange equations which arise from the problems in calculus of variations. Some examples of variational problems are given and outcomes compared with exact solutions to demonstrate the accuracy and efficiency of the method.
متن کاملA Note on Turán Numbers for Even Wheels
The Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. We consider a very special case of the Simonovits’s theorem (Simonovits in: Theory of graphs, Academic Press, New York, 1968) which determine an asymptotic result for Turán numbers for graphs with some properties. In the paper we present a more precise result for even ...
متن کاملSome Personal Reminiscences of the Mathematical Work of Paul Turán
Our frienctslup and collaboration spread over most of our active and scientific life. We first met at the University of Budapest in September 1930 and innnediately discovered our common interest in number theory and prinie nuinbers in particular. Our last mathematical discussion 11 days before his death was also about prime numbers. My last letter to hini (written from Canada) arrived after he ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 45 شماره
صفحات -
تاریخ انتشار 1987