AbstractFor the smallest number of non-overlapping vertex-to-vertex unit triangles in the plane it is proved ⩽42 in general, and ⩽3800 if additional triangles are not allowed
AbstractIt is known that under appropriate assumptions, each plane graph contains a vertex of degree...
We prove a conjecture of Erdős, Purdy, and Straus on the number of distinct areas of triangles dete...
A matchstick graph is a crossing-free unit-distance graph in the plane. Harborth (1981) proposed the...
ABSTRACT. A graph G = (V,E) is called a unit-distance graph in the plane if there is an injective em...
AbstractA triangle incident with vertices of degrees a, b and c is said to be an (a, b, c)-triangle....
AbstractWe show that a K4-free graph with e edges has at most (e⧸3)32 triangles. This supercedes a b...
AbstractIt is known that under appropriate assumptions, each plane graph contains a vertex of degree...
AbstractLet S be a set of n⩾4 points in general position in the plane, and let h<n be the number of ...
Abstract A match-stick graph is a plane geometric graph in which every edge has length 1 and no two ...
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 ...
AbstractConsider the (n3) triangles determined by some n points in general position in 3-dimensional...
AbstractIt is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence ...
AbstractBose and Laskar introduced the tetrahedral graph G, whose points may be identified with the ...
AbstractA set of n nonconcurrent lines in the projective plane (called an arrangment) divides the pl...
AbstractIt is known that under appropriate assumptions, each plane graph contains a vertex of degree...
We prove a conjecture of Erdős, Purdy, and Straus on the number of distinct areas of triangles dete...
A matchstick graph is a crossing-free unit-distance graph in the plane. Harborth (1981) proposed the...
ABSTRACT. A graph G = (V,E) is called a unit-distance graph in the plane if there is an injective em...
AbstractA triangle incident with vertices of degrees a, b and c is said to be an (a, b, c)-triangle....
AbstractWe show that a K4-free graph with e edges has at most (e⧸3)32 triangles. This supercedes a b...
AbstractIt is known that under appropriate assumptions, each plane graph contains a vertex of degree...
AbstractLet S be a set of n⩾4 points in general position in the plane, and let h<n be the number of ...
Abstract A match-stick graph is a plane geometric graph in which every edge has length 1 and no two ...
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 ...
AbstractConsider the (n3) triangles determined by some n points in general position in 3-dimensional...
AbstractIt is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence ...
AbstractBose and Laskar introduced the tetrahedral graph G, whose points may be identified with the ...
AbstractA set of n nonconcurrent lines in the projective plane (called an arrangment) divides the pl...
AbstractIt is known that under appropriate assumptions, each plane graph contains a vertex of degree...
We prove a conjecture of Erdős, Purdy, and Straus on the number of distinct areas of triangles dete...
A matchstick graph is a crossing-free unit-distance graph in the plane. Harborth (1981) proposed the...
DOI
Add to ORKG