This article provides a simple characterization of regular graphs with an even number of vertices in terms of induced subgraphs. Namely, given a graph G with 2k vertices, G is regular iff each partition of V(G) into two k-element subsets induces two subgraphs with the same number of edges.</p
Throughout this paper, by a graph we mean a finite, simple, connected, undirected graph G(V,E). For ...
A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively ad...
summary:A graph $G$ is called locally $s$-regular if the neighbourhood of each vertex of $G$ induces...
AbstractAn even cycle decomposition of a graph is a partition of its edge into even cycles. We first...
Abstract. The Szemerédi Regularity Lemma states that any sufficiently large graph G can be partitio...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
Abstract: We prove a conjecture of Alon on the number of independent sets in a regular graph, and th...
AbstractThis paper deals with the enumeration of distinct embeddings (both induced and partial) of a...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractWe discuss the following conjecture: If G = (V, E) is a Δ-regular simple graph with an even ...
We consider the class ER(n, d, lambda) of edge-regular graphs for some n > d > lambda, i.e., graphs ...
In this paper, we completely resolve the well-known problem of ErdÅ s and Sauer from 1975 which asks...
In this paper, we consider only finite, simple, connected graphs. For basic definitions and terminol...
AbstractWe prove that the maximum number of edges in a k-uniform hypergraph on n vertices containing...
A (k,t)-regular set is a vertex subset S inducing a k-regular subgraph such that every vertex out of...
Throughout this paper, by a graph we mean a finite, simple, connected, undirected graph G(V,E). For ...
A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively ad...
summary:A graph $G$ is called locally $s$-regular if the neighbourhood of each vertex of $G$ induces...
AbstractAn even cycle decomposition of a graph is a partition of its edge into even cycles. We first...
Abstract. The Szemerédi Regularity Lemma states that any sufficiently large graph G can be partitio...
AbstractLet G be a k-regular, (k−1)-edge-connected graph with an even number of vertices, and let m ...
Abstract: We prove a conjecture of Alon on the number of independent sets in a regular graph, and th...
AbstractThis paper deals with the enumeration of distinct embeddings (both induced and partial) of a...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractWe discuss the following conjecture: If G = (V, E) is a Δ-regular simple graph with an even ...
We consider the class ER(n, d, lambda) of edge-regular graphs for some n > d > lambda, i.e., graphs ...
In this paper, we completely resolve the well-known problem of ErdÅ s and Sauer from 1975 which asks...
In this paper, we consider only finite, simple, connected graphs. For basic definitions and terminol...
AbstractWe prove that the maximum number of edges in a k-uniform hypergraph on n vertices containing...
A (k,t)-regular set is a vertex subset S inducing a k-regular subgraph such that every vertex out of...
Throughout this paper, by a graph we mean a finite, simple, connected, undirected graph G(V,E). For ...
A graph G is a (t, r)-regular graph if every collection of t independent vertices is collectively ad...
summary:A graph $G$ is called locally $s$-regular if the neighbourhood of each vertex of $G$ induces...
DOI
Add to ORKG