Saved in:
| Main Author: | Kuzmanovski, Nikola |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.08299 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Macaulay Posets and Rings
by: Kuzmanovski, Nikola
Published: (2023)
by: Kuzmanovski, Nikola
Published: (2023)
The MacaulayPosets package for Macaulay2
by: Beall, Penelope, et al.
Published: (2025)
by: Beall, Penelope, et al.
Published: (2025)
On the Structure of Hamiltonian Graphs with Small Independence Number
by: Jedličková, Nikola, et al.
Published: (2024)
by: Jedličková, Nikola, et al.
Published: (2024)
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)
by: Jedličková, Nikola, et al.
Published: (2023)
Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs
by: Aichholzer, Oswin, et al.
Published: (2023)
by: Aichholzer, Oswin, et al.
Published: (2023)
On colorful generalizations of the Goodman--Pollack transversal problem
by: Sadovek, Nikola
Published: (2026)
by: Sadovek, Nikola
Published: (2026)
A Bivariate $B$-Restricted Clique Polynomial: From Local Neighborhoods to Global Expansion
by: Faal, Hossein Teimoori
Published: (2026)
by: Faal, Hossein Teimoori
Published: (2026)
Completely greedy coin sets
by: Young, Andrew J.
Published: (2024)
by: Young, Andrew J.
Published: (2024)
On the maximal size of $(a,b)$-town$\pmod k$ families
by: Veselinov, Nikola, et al.
Published: (2025)
by: Veselinov, Nikola, et al.
Published: (2025)
Completely regular codes in graphs covered by a Hamming graph
by: Goryainov, Sergey, et al.
Published: (2024)
by: Goryainov, Sergey, et al.
Published: (2024)
Experimenting with the Garsia-Milne Involution Principle
by: Ekhad, Shalosh B., et al.
Published: (2025)
by: Ekhad, Shalosh B., et al.
Published: (2025)
Computational complexity of covering regular trees
by: Bok, Jan, et al.
Published: (2025)
by: Bok, Jan, et al.
Published: (2025)
List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph
by: Kaul, Hemanshu, et al.
Published: (2025)
by: Kaul, Hemanshu, et al.
Published: (2025)
A necessary and sufficient condition for $k$-transversals
by: McGinnis, Daniel, et al.
Published: (2024)
by: McGinnis, Daniel, et al.
Published: (2024)
An EKR Theorem for the Cartesian Product of Complete Graphs
by: Joseph, Zaphenath
Published: (2025)
by: Joseph, Zaphenath
Published: (2025)
Colouring Complete Multipartite and Kneser-type Digraphs
by: Harutyunyan, Ararat, et al.
Published: (2023)
by: Harutyunyan, Ararat, et al.
Published: (2023)
New Method for Constructing Complete Cap Sets
by: Karapetyana, Iskandar, et al.
Published: (2026)
by: Karapetyana, Iskandar, et al.
Published: (2026)
Associated Permutations of Complete Non-Ambiguous Trees
by: Chen, Daniel, et al.
Published: (2022)
by: Chen, Daniel, et al.
Published: (2022)
Alternative Proof of the Determinant of Complete Non-Ambiguous Trees
by: Chen, Daniel
Published: (2024)
by: Chen, Daniel
Published: (2024)
Completing the solution of the directed Oberwolfach problem with two tables
by: Horsley, Daniel, et al.
Published: (2024)
by: Horsley, Daniel, et al.
Published: (2024)
On the Automorphism Group of Token Graphs of Complete Bipartite Graphs
by: Fabila-Monroy, Ruy, et al.
Published: (2023)
by: Fabila-Monroy, Ruy, et al.
Published: (2023)
A Completion Result for Partial Affine and Inversive Spaces
by: Grace, Cassie, et al.
Published: (2025)
by: Grace, Cassie, et al.
Published: (2025)
Completely independent Steiner trees and corresponding tree connectivity
by: Yuan, Jun, et al.
Published: (2025)
by: Yuan, Jun, et al.
Published: (2025)
Characterization of Complete Bipartite Graphs via Resistance Spectra
by: Liu, Xiang-Yang, et al.
Published: (2025)
by: Liu, Xiang-Yang, et al.
Published: (2025)
The Partition Dimension of Corona Product of Complete and Wheel Graph
by: Yusuf, Muhammad Ahnaf, et al.
Published: (2025)
by: Yusuf, Muhammad Ahnaf, et al.
Published: (2025)
List homomorphisms to separable signed graphs
by: Bok, Jan, et al.
Published: (2023)
by: Bok, Jan, et al.
Published: (2023)
On the expressive power of $2$-edge-colourings of graphs
by: Bok, Jan, et al.
Published: (2025)
by: Bok, Jan, et al.
Published: (2025)
Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
by: Bok, Jan, et al.
Published: (2025)
by: Bok, Jan, et al.
Published: (2025)
Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)
by: Maheshwari, Anil, et al.
Published: (2026)
Flat origami is Turing Complete
by: Hull, Thomas C., et al.
Published: (2023)
by: Hull, Thomas C., et al.
Published: (2023)
Complete Resolution of the Butler-Costello-Graham Conjecture on Monochromatic Constellations
by: Yang, Gang, et al.
Published: (2026)
by: Yang, Gang, et al.
Published: (2026)
Limit Laws for Consensus Protocols on the Complete Graph
by: Becker, Julian, et al.
Published: (2026)
by: Becker, Julian, et al.
Published: (2026)
An Invariance Principle for the Multi-slice, with Applications
by: Braverman, Mark, et al.
Published: (2021)
by: Braverman, Mark, et al.
Published: (2021)
Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree
by: Chen, Yihan, et al.
Published: (2024)
by: Chen, Yihan, et al.
Published: (2024)
Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors
by: Chudnovsky, Maria, et al.
Published: (2024)
by: Chudnovsky, Maria, et al.
Published: (2024)
Completing the Asymptotic Classification of Mostly Symmetric Short Step Walks in an Orthant
by: Kroitor, Alexander, et al.
Published: (2024)
by: Kroitor, Alexander, et al.
Published: (2024)
A Complete Characterization of the Inverse Eigenvector Centrality Problem for Undirected Graphs
by: Passacantando, Mauro, et al.
Published: (2026)
by: Passacantando, Mauro, et al.
Published: (2026)
Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)
by: Ebrahimi, Javad B., et al.
Published: (2024)
Extremal densities for forbidden configurations in $S$-smooth numbers
by: Veselinov, Nikola
Published: (2026)
by: Veselinov, Nikola
Published: (2026)
Noise Sensitivity of the Minimum Spanning Tree of the Complete Graph
by: Israeli, Omer, et al.
Published: (2023)
by: Israeli, Omer, et al.
Published: (2023)
Similar Items
-
Macaulay Posets and Rings
by: Kuzmanovski, Nikola
Published: (2023) -
The MacaulayPosets package for Macaulay2
by: Beall, Penelope, et al.
Published: (2025) -
On the Structure of Hamiltonian Graphs with Small Independence Number
by: Jedličková, Nikola, et al.
Published: (2024) -
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023) -
Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs
by: Aichholzer, Oswin, et al.
Published: (2023)