AbstractThe uniform subset graph G(n, k, t) is defined to have all k-subsets of an n-set as vertices and edges joining k-subsets intersecting at t elements. We conjecture that G(n, k, t) is hamiltonian when it is different from the Petersen graph and does possess cycles. We verify this conjecture for k − t = 1, 2, 3 and for suitably large n when t = 0, 1
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
In 1970 Lov\'asz conjectured that every connected vertex-transitive graph admits a Hamilton cycle, a...
n be the complete k-uniform hypergraph, k ≥ 3, and let ` be an integer such that 1 ≤ ` ≤ k − 1 and...
AbstractThe uniform subset graph G(n, k, t) is defined to have all k-subsets of an n-set as vertices...
Given $k\ge3$ and $1\leq \ell< k$, an $(\ell,k)$-cycle is one in which consecutive edges, each of si...
Abstract. We say that a k-uniform hypergraph C is an `-cycle if there exists a cyclic ordering of th...
Komlós conjectured in 1981 that among all graphs with minimum degree at least d, the complete graph ...
We prove for all k\geq 4 and 1\leq \ell <k/2 the sharp minimum (k-2)-degree bound for a k-uniform...
AbstractWe say that a k-uniform hypergraph C is an ℓ-cycle if there exists a cyclic ordering of the ...
For integers~$k\geq 1$ and $n\geq 2k+1$, the Kneser graph~$K(n,k)$ has as vertices all $k$-element s...
Let K(k)n be the complete k-uniform hypergraph, k≥3, and let ℓ be an integer such that 1≤ℓ≤k−1 and k...
The generalized Petersen graph G(n, k), 1≤k≤n−1, is defined as follows: The graph G(n, k) has vertic...
AbstractWe present a solution of two problems of P. Erdős on packing a set of r graphs into the comp...
We define and study a special type of hypergraph. A σ-hypergraph H = H(n, r, q | σ), where σ is a pa...
In this dissertation we study the Hamiltonicity and the uniform-Hamiltonicity of subset graphs, subs...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
In 1970 Lov\'asz conjectured that every connected vertex-transitive graph admits a Hamilton cycle, a...
n be the complete k-uniform hypergraph, k ≥ 3, and let ` be an integer such that 1 ≤ ` ≤ k − 1 and...
AbstractThe uniform subset graph G(n, k, t) is defined to have all k-subsets of an n-set as vertices...
Given $k\ge3$ and $1\leq \ell< k$, an $(\ell,k)$-cycle is one in which consecutive edges, each of si...
Abstract. We say that a k-uniform hypergraph C is an `-cycle if there exists a cyclic ordering of th...
Komlós conjectured in 1981 that among all graphs with minimum degree at least d, the complete graph ...
We prove for all k\geq 4 and 1\leq \ell <k/2 the sharp minimum (k-2)-degree bound for a k-uniform...
AbstractWe say that a k-uniform hypergraph C is an ℓ-cycle if there exists a cyclic ordering of the ...
For integers~$k\geq 1$ and $n\geq 2k+1$, the Kneser graph~$K(n,k)$ has as vertices all $k$-element s...
Let K(k)n be the complete k-uniform hypergraph, k≥3, and let ℓ be an integer such that 1≤ℓ≤k−1 and k...
The generalized Petersen graph G(n, k), 1≤k≤n−1, is defined as follows: The graph G(n, k) has vertic...
AbstractWe present a solution of two problems of P. Erdős on packing a set of r graphs into the comp...
We define and study a special type of hypergraph. A σ-hypergraph H = H(n, r, q | σ), where σ is a pa...
In this dissertation we study the Hamiltonicity and the uniform-Hamiltonicity of subset graphs, subs...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
In 1970 Lov\'asz conjectured that every connected vertex-transitive graph admits a Hamilton cycle, a...
n be the complete k-uniform hypergraph, k ≥ 3, and let ` be an integer such that 1 ≤ ` ≤ k − 1 and...
DOI
Add to ORKG