AbstractFor any two positive integers n⩾r⩾1, the well-known Turán Theorem states that there exists a least positive integer ex(n,Kr) such that every graph with n vertices and ex(n,Kr)+1 edges contains a subgraph isomorphic to Kr. We determine the minimum number of edges sufficient for the existence of k cliques with r vertices each intersecting in exactly one common vertex
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
This dissertation contains results from various areas of Combinatorics. In Chapter 2, we consider a...
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many ...
AbstractIt is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence ...
AbstractIt is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence ...
In a broad sense, graph theory has always been present in civilization. Graph theory is the math of ...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
© 2021 Elsevier Inc.Generalized Turán problems have been a central topic of study in extremal combin...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
AbstractIn this paper we study several interrelated extremal graph problems: 1.(i) Given integers n,...
AbstractIn this note we complete an investigation started by Erdős in 1963 that aims to find the str...
In this note we complete an investigation started by Erdo{double acute}s in 1963 that aims to find t...
The problem of determining extremal hypergraphs containing at most r isomorphic copies of some eleme...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
This dissertation contains results from various areas of Combinatorics. In Chapter 2, we consider a...
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many ...
AbstractIt is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence ...
AbstractIt is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence ...
In a broad sense, graph theory has always been present in civilization. Graph theory is the math of ...
Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
© 2021 Elsevier Inc.Generalized Turán problems have been a central topic of study in extremal combin...
We consider the following two problems. (1) Let t and n be positive integers with n # t # 2. Det...
AbstractIn this paper we study several interrelated extremal graph problems: 1.(i) Given integers n,...
AbstractIn this note we complete an investigation started by Erdős in 1963 that aims to find the str...
In this note we complete an investigation started by Erdo{double acute}s in 1963 that aims to find t...
The problem of determining extremal hypergraphs containing at most r isomorphic copies of some eleme...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
New results are proved on several problems in extremal graph theory.Let $ex\sp*(D;H)$ denote the max...
This dissertation contains results from various areas of Combinatorics. In Chapter 2, we consider a...
DOI
Add to ORKG