Large cycles in generalized Johnson graphs
From MaRDI portal
Publication:6084722
DOI10.1002/jgt.23006zbMath1526.05078arXiv2203.03006OpenAlexW4383720925MaRDI QIDQ6084722
M. E. Zhukovskii, Unnamed Author
Publication date: 6 November 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.03006
Enumeration in graph theory (05C30) Paths and cycles (05C38) Distance in graphs (05C12) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independence numbers of random subgraphs of distance graphs
- On the chromatic number of \(\mathbb R^4\)
- Some new distance-4 constant weight codes
- Kneser's conjecture, chromatic number, and homotopy
- On the chromatic number of rational five-space
- On the diameter of generalized Kneser graphs
- Diameters of uniform subset graphs
- Hamiltonian uniform subset graphs
- Maximum bipartite subgraphs of Kneser graphs
- Extremal problems and coverings of the space
- Intersection theorems with geometric consequences
- The odd girth of the generalised Kneser graph
- Triangle-free Hamiltonian Kneser graphs
- A combinatorical proof of Kneser's conjecture
- Finite Euclidean Ramsey theory
- On the chromatic number, colorings, and codes of the Johnson graph
- A classification of the strongly regular generalised Johnson graphs
- On the probability of the occurrence of a copy of a fixed graph in a random distance graph
- On the girth and diameter of generalized Johnson graphs
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Inverses of triangular matrices and bipartite graphs
- On the chromatic number of \(\mathbb{R}^{9}\)
- On the diameter of Kneser graphs
- Borsuk's problem and the chromatic numbers of some metric spaces
- Small Subgraphs in Random Distance Graphs
- Coloring Distance Graphs and Graphs of Diameters
- Johnson graphs are Hamilton-connected
- A counterexample to Borsuk’s conjecture
- On the chromatic number of the general Kneser-graph
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Small subgraphs and their extensions in a random distance graph
- Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs
- On the Nonexistence of Perfect Codes in the Johnson Scheme
- Combinatorial Geometry and Coding Theory*
- Sparse Kneser graphs are Hamiltonian
- The realization of distances within sets in Euclidean space
This page was built for publication: Large cycles in generalized Johnson graphs
