Add to ORKGWe prove a theorem on how to count induced subgraphs in neighbor-hoods of graphs. Then we use it to prove a subgraph counting identity conjectured by McKay and Radziszowski in their work on Ramsey theory.
Many real-world phenomena are modeled by large graphs. Subgraph counting, the problem of counting oc...
The main result of this thesis is the proof of the "w-cycle conjecture". This was done in collaborat...
We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in ve...
We study the problem #INDSUB(Φ) of counting all induced subgraphs of size k in a graph G that satisf...
We study the problem #INDSUB(Φ) of counting all induced subgraphs of size k in a graph G that satisf...
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of s...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
We investigate the problem # IndSub(Φ) of counting all induced subgraphs of size k in a graph G that...
We investigate the problem #IndSub(Φ) of counting all induced subgraphs of size k in a graph G that ...
For a regular graph on n vertices, of degree r, determine the number of matchings with m edges. A ma...
Extremal problems involving the enumeration of graph substructures have a long history in graph theo...
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multig...
Ahlswede R, Cai N, Zhang Z. A recursive bound for the number of complete K-subgraphs of a graph. In:...
An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clog2n (i.e., if...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
Many real-world phenomena are modeled by large graphs. Subgraph counting, the problem of counting oc...
The main result of this thesis is the proof of the "w-cycle conjecture". This was done in collaborat...
We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in ve...
We study the problem #INDSUB(Φ) of counting all induced subgraphs of size k in a graph G that satisf...
We study the problem #INDSUB(Φ) of counting all induced subgraphs of size k in a graph G that satisf...
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of s...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
We investigate the problem # IndSub(Φ) of counting all induced subgraphs of size k in a graph G that...
We investigate the problem #IndSub(Φ) of counting all induced subgraphs of size k in a graph G that ...
For a regular graph on n vertices, of degree r, determine the number of matchings with m edges. A ma...
Extremal problems involving the enumeration of graph substructures have a long history in graph theo...
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multig...
Ahlswede R, Cai N, Zhang Z. A recursive bound for the number of complete K-subgraphs of a graph. In:...
An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clog2n (i.e., if...
This thesis contains new contributions to Ramsey theory, in particular results that establish exact ...
Many real-world phenomena are modeled by large graphs. Subgraph counting, the problem of counting oc...
The main result of this thesis is the proof of the "w-cycle conjecture". This was done in collaborat...
We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in ve...