Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lower bound for the maximum number of unique subgraphs in any n-point graph, which we now improve.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/33805/1/0000060.pd
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtai...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
AbstractA question of Entringer and Erdös concerning the number of unique subgraphs of a graph is an...
A question of Entringer and Erdös concerning the number of unique subgraphs of a graph is answered
AbstractWe present a conjecture on the maximum number of edges of a graph that has a unique minimum ...
AbstractFor n ≥ 3, if there exists a uniquely n colorable graph which contains no subgraph isomorphi...
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
International audienceA unique-path labelling of a simple, fi nite graph is a labelling of its edges...
We determine the maximum number of edges of an n -vertex graph G with the property that none of its ...
Extremal problems concerning the number of independent sets or complete subgraphs in a graph have be...
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
Extremal problems involving the enumeration of graph substructures have a long history in graph theo...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
AbstractEntringer and Erdös introduced the concept of a unique subgraph of a given graph G and obtai...
Entringer and Erdos introduced the concept of a unique subgraph of a given graph G and obtained a lo...
AbstractA question of Entringer and Erdös concerning the number of unique subgraphs of a graph is an...
A question of Entringer and Erdös concerning the number of unique subgraphs of a graph is answered
AbstractWe present a conjecture on the maximum number of edges of a graph that has a unique minimum ...
AbstractFor n ≥ 3, if there exists a uniquely n colorable graph which contains no subgraph isomorphi...
AbstractThis paper is partitioned into two parts. In the first part we determine the maximum number ...
International audienceA unique-path labelling of a simple, fi nite graph is a labelling of its edges...
We determine the maximum number of edges of an n -vertex graph G with the property that none of its ...
Extremal problems concerning the number of independent sets or complete subgraphs in a graph have be...
AbstractFor suitable integers p and k, let f(p, k) denote the maximum number of edges in a graph of ...
Extremal problems involving the enumeration of graph substructures have a long history in graph theo...
One of the cornerstones of extremal graph theory is a result of Füredi, later reproved and given due...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
DOI
Add to ORKG