The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Given a graph H , the Turán function ex ( n , H ) is the maximum number of edges in a graph on n vertices that does not contain H as a subgraph. Let s , t be integers and let H s , t be a graph consisting of s triangles and t cycles of odd lengths at least 5 which intersect in exactly one common vertex. Erdős et al. (1995) determined the Turán function ex ( n , H s ,...
For two graphs G and H , the Turán number ex ( G , H ) is the maximum number of edges in a subgraph of G that contains no copy of H . Chen, Li, and Tu determined the Turán numbers ex ( K m , n , k K 2 ) for all k ≥ 1 Chen et al. (2009). In this paper we will determine the Turán numbers ex ( K a 1 , … , a r , k K r ) for all r ≥ 3 and k...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.