Large cycles in generalized Johnson graphs
From MaRDI portal
Publication:6084722
Abstract: We count cycles of an unbounded length in generalized Johnson graphs. Asymptotics of the number of such cycles is obtained for certain growth rates of the cycle length.
Recommendations
- Large cycles in random generalized Johnson graphs
- Cycles in graphs of fixed girth with large size
- Maximal cycles in graphs of large girth
- Dirac-type generalizations concerning large cycles in graphs
- Long cycles in certain graphs of large degree
- Long cycles in graphs with large degree sums
- Cycles in graphs with large independence ratio
- Large cycles in 4-connected graphs
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
- A sufficient condition guaranteeing large cycles in graphs
Cites work
- A classification of the strongly regular generalised Johnson graphs
- A combinatorical proof of Kneser's conjecture
- A counterexample to Borsuk’s conjecture
- Borsuk's problem and the chromatic numbers of some metric spaces
- Coloring distance graphs and graphs of diameters
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Combinatorial geometry and coding theory
- Diameters of uniform subset graphs
- Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs
- Extremal problems and coverings of the space
- Finite Euclidean Ramsey theory
- Hamiltonian uniform subset graphs
- scientific article; zbMATH DE number 3683587 (Why is no real title available?)
- scientific article; zbMATH DE number 638692 (Why is no real title available?)
- scientific article; zbMATH DE number 2059939 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 1439479 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Independence numbers of random subgraphs of distance graphs
- Intersection theorems with geometric consequences
- Inverses of triangular matrices and bipartite graphs
- Johnson graphs are Hamilton-connected
- Kneser's conjecture, chromatic number, and homotopy
- Maximum bipartite subgraphs of Kneser graphs
- On the chromatic number of \(\mathbb R^4\)
- On the chromatic number of \(\mathbb{R}^{9}\)
- On the chromatic number of rational five-space
- On the chromatic number of the general Kneser-graph
- On the chromatic number, colorings, and codes of the Johnson graph
- On the diameter of generalized Kneser graphs
- On the diameter of Kneser graphs
- On the girth and diameter of generalized Johnson graphs
- On the Nonexistence of Perfect Codes in the Johnson Scheme
- On the probability of the occurrence of a copy of a fixed graph in a random distance graph
- Small subgraphs and their extensions in a random distance graph
- Small subgraphs in random distance graphs
- Some new distance-4 constant weight codes
- Sparse Kneser graphs are Hamiltonian
- The odd girth of the generalised Kneser graph
- The realization of distances within sets in Euclidean space
- Triangle-free Hamiltonian Kneser graphs
This page was built for publication: Large cycles in generalized Johnson graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6084722)
