Saved in:
| Main Author: | Kravchuk, Artem |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.14948 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Constructing segments of quadratic length in $Spec(T_n)$ through segments of linear length
by: Kravchuk, Artem
Published: (2024)
by: Kravchuk, Artem
Published: (2024)
Transposition diameter on circular binary strings
by: Nakanishi, Misa
Published: (2017)
by: Nakanishi, Misa
Published: (2017)
The spanning tree spectrum: improved bounds and simple proofs
by: Alon, Noga, et al.
Published: (2025)
by: Alon, Noga, et al.
Published: (2025)
The proof of a conjecture about cages
by: Pan, Xiang-Feng, et al.
Published: (2024)
by: Pan, Xiang-Feng, et al.
Published: (2024)
A note on semi-transitivity of Mycielski graphs
by: Kitaev, Sergey, et al.
Published: (2024)
by: Kitaev, Sergey, et al.
Published: (2024)
A graph theoretic proof of Cramer's rule
by: Bera, Sudip
Published: (2025)
by: Bera, Sudip
Published: (2025)
On the representation number of grid graphs and cylindric grid graphs
by: Alshammari, Nawaf Shafi, et al.
Published: (2025)
by: Alshammari, Nawaf Shafi, et al.
Published: (2025)
The distance spectrum of the line graph of the crown graph
by: Mirafzal, S. Morteza
Published: (2025)
by: Mirafzal, S. Morteza
Published: (2025)
New tools to study 1-11-representation of graphs
by: Futorny, Mikhail, et al.
Published: (2024)
by: Futorny, Mikhail, et al.
Published: (2024)
Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited)
by: Biedl, Therese
Published: (2025)
by: Biedl, Therese
Published: (2025)
Jones' conjecture for Halin graphs and a bit more
by: Bärnkopf, Pál, et al.
Published: (2024)
by: Bärnkopf, Pál, et al.
Published: (2024)
A simple proof of the existence of complete bipartite graph immersion in graphs with independence number two
by: Chen, Rong, et al.
Published: (2024)
by: Chen, Rong, et al.
Published: (2024)
Asymmetric results about graph homomorphisms
by: Gishboliner, Lior, et al.
Published: (2025)
by: Gishboliner, Lior, et al.
Published: (2025)
Eccentricity spectrum of join of central graphs and Eccentricity Wiener index of graphs
by: Ashokan, Anjitha, et al.
Published: (2024)
by: Ashokan, Anjitha, et al.
Published: (2024)
Cutoff for the Biased Random Transposition Shuffle
by: Nestoridi, Evita, et al.
Published: (2024)
by: Nestoridi, Evita, et al.
Published: (2024)
The design spectrum of the Shrikhande graph
by: Forbes, Anthony D., et al.
Published: (2025)
by: Forbes, Anthony D., et al.
Published: (2025)
Tree walks and the spectrum of random graphs
by: Hainzl, Eva-Maria, et al.
Published: (2024)
by: Hainzl, Eva-Maria, et al.
Published: (2024)
Exponentially many graphs are determined by their spectrum
by: Koval, Illya, et al.
Published: (2023)
by: Koval, Illya, et al.
Published: (2023)
Determining some graph joins by the signless Laplacian spectrum
by: Ye, Jiachang, et al.
Published: (2025)
by: Ye, Jiachang, et al.
Published: (2025)
Anticoncentration in Ramsey graphs and a proof of the Erdős-McKay conjecture
by: Kwan, Matthew, et al.
Published: (2022)
by: Kwan, Matthew, et al.
Published: (2022)
A graph-theoretic proof of Cobham's Dichotomy for automatic sequences
by: Wessel, Mieke
Published: (2024)
by: Wessel, Mieke
Published: (2024)
The Cutoff Profile for Random Transpositions on Repeated Cards in the Full Range of Parameters
by: Shen, Jiahe
Published: (2026)
by: Shen, Jiahe
Published: (2026)
A brief note about p-curvature on graphs
by: Hu, Chunyang
Published: (2026)
by: Hu, Chunyang
Published: (2026)
Connected graphs with large multiplicity of $-1$ in the spectrum of the eccentricity matrix
by: Zhao, Xinghui, et al.
Published: (2024)
by: Zhao, Xinghui, et al.
Published: (2024)
Hexagonal and k-hexagonal graph's normalized Laplacian spectrum and applications
by: Li, Hao, et al.
Published: (2025)
by: Li, Hao, et al.
Published: (2025)
Main functions and the spectrum of super graphs
by: Arunkumar, G., et al.
Published: (2024)
by: Arunkumar, G., et al.
Published: (2024)
A proof that HT is more likely to outnumber HH than vice versa in a sequence of n coin flips
by: Segert, Simon
Published: (2024)
by: Segert, Simon
Published: (2024)
Proof of the strong conjecture about $F$-irregular graphs in the class of graphs $\{F\}$ of diameter $2$
by: Dovzhenok, Tatiana
Published: (2026)
by: Dovzhenok, Tatiana
Published: (2026)
The spectrum of dense kernel-based random graphs
by: Cipriani, Alessandra, et al.
Published: (2025)
by: Cipriani, Alessandra, et al.
Published: (2025)
On a question of Erdős and Nešetřil about minimal cuts in a graph
by: Bradač, Domagoj
Published: (2024)
by: Bradač, Domagoj
Published: (2024)
A method for constructing graphs with the same resistance spectrum
by: Xu, Si-Ao, et al.
Published: (2024)
by: Xu, Si-Ao, et al.
Published: (2024)
A proof of the $\frac{3}{8}$-conjecture for independent domination in cubic graphs
by: Brešar, Boštjan, et al.
Published: (2025)
by: Brešar, Boštjan, et al.
Published: (2025)
Elementary proofs of the diameter bounds for the power graphs
by: Barbieri, Marco, et al.
Published: (2024)
by: Barbieri, Marco, et al.
Published: (2024)
Upper Embeddability of Graphs and Products of Transpositions Associated with Edges
by: Tsujie, Shuhei, et al.
Published: (2022)
by: Tsujie, Shuhei, et al.
Published: (2022)
One-factorizations of complete multipartite graphs with distance constraints
by: Tan, Yuli, et al.
Published: (2026)
by: Tan, Yuli, et al.
Published: (2026)
Graph isomorphism and multivariate graph spectrum
by: Wang, Wei, et al.
Published: (2024)
by: Wang, Wei, et al.
Published: (2024)
Self-avoiding walk is ballistic on graphs with more than one end
by: Lehner, Florian, et al.
Published: (2024)
by: Lehner, Florian, et al.
Published: (2024)
Trees and co-trees in planar 3-connected graphs An easier proof via Schnyder woods
by: Ortlieb, Christian, et al.
Published: (2024)
by: Ortlieb, Christian, et al.
Published: (2024)
On a new problem about the local irregularity of graphs
by: Grzelec, Igor, et al.
Published: (2024)
by: Grzelec, Igor, et al.
Published: (2024)
An improved condition for a graph to be determined by its generalized spectrum
by: Wang, Wei, et al.
Published: (2021)
by: Wang, Wei, et al.
Published: (2021)
Similar Items
-
Constructing segments of quadratic length in $Spec(T_n)$ through segments of linear length
by: Kravchuk, Artem
Published: (2024) -
Transposition diameter on circular binary strings
by: Nakanishi, Misa
Published: (2017) -
The spanning tree spectrum: improved bounds and simple proofs
by: Alon, Noga, et al.
Published: (2025) -
The proof of a conjecture about cages
by: Pan, Xiang-Feng, et al.
Published: (2024) -
A note on semi-transitivity of Mycielski graphs
by: Kitaev, Sergey, et al.
Published: (2024)