AbstractIt is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence of k triangles intersecting in exactly one common vertex
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prov...
We prove a conjecture of Erdős, Purdy, and Straus on the number of distinct areas of triangles dete...
AbstractIt is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence ...
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many ...
AbstractFor any two positive integers n⩾r⩾1, the well-known Turán Theorem states that there exists a...
A celebrated result of Mantel shows that every graph on n vertices with left perpendicularn(2)/4righ...
A convex geometric hypergraph or cgh consists of a family of subsets of a strictly convex set of poi...
AbstractLet S be a set of n points in the plane, and let T be a set of m triangles with vertices in ...
AbstractThe concept of unique intersectability of a graph is introduced; this is related to the inte...
AbstractLet ƒ(n,H,X) be the maximal number of edges in a graph with n vertices not containing a subg...
AbstractIt is shown that the number of triangles in a self-complementary graph with N vertices is at...
We consider the problem of minimizing the number of edges that are contained in triangles, among n-v...
AbstractWe show that a K4-free graph with e edges has at most (e⧸3)32 triangles. This supercedes a b...
AbstractWe show that a K4-free graph with e edges has at most (e⧸3)32 triangles. This supercedes a b...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prov...
We prove a conjecture of Erdős, Purdy, and Straus on the number of distinct areas of triangles dete...
AbstractIt is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence ...
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many ...
AbstractFor any two positive integers n⩾r⩾1, the well-known Turán Theorem states that there exists a...
A celebrated result of Mantel shows that every graph on n vertices with left perpendicularn(2)/4righ...
A convex geometric hypergraph or cgh consists of a family of subsets of a strictly convex set of poi...
AbstractLet S be a set of n points in the plane, and let T be a set of m triangles with vertices in ...
AbstractThe concept of unique intersectability of a graph is introduced; this is related to the inte...
AbstractLet ƒ(n,H,X) be the maximal number of edges in a graph with n vertices not containing a subg...
AbstractIt is shown that the number of triangles in a self-complementary graph with N vertices is at...
We consider the problem of minimizing the number of edges that are contained in triangles, among n-v...
AbstractWe show that a K4-free graph with e edges has at most (e⧸3)32 triangles. This supercedes a b...
AbstractWe show that a K4-free graph with e edges has at most (e⧸3)32 triangles. This supercedes a b...
AbstractThe number T∗(n,k) is the least positive integer such that every graph with n = (2k+1) + t v...
An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prov...
We prove a conjecture of Erdős, Purdy, and Straus on the number of distinct areas of triangles dete...
DOI
Add to ORKG