Lorentzian polynomials and the independence sequences of graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Bendjeddou, Amire, Hardiman, Leonard |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Identifying contact graphs of sphere packings with generic radii
by: Dewar, Sean
Published: (2023)
by: Dewar, Sean
Published: (2023)
Veronese polytopes: Extending the framework of cyclic polytopes
by: Brandenburg, Marie-Charlotte, et al.
Published: (2024)
by: Brandenburg, Marie-Charlotte, et al.
Published: (2024)
No-three-in-line sets on the checkerboard grid
by: Prellberg, Thomas
Published: (2026)
by: Prellberg, Thomas
Published: (2026)
Transitive $(q-1)$-fold packings of $\rm{PG}_n(q)$
by: Hawtin, Daniel R.
Published: (2024)
by: Hawtin, Daniel R.
Published: (2024)
On the Chromatic Number of Grassmann Graphs
by: D'haeseleer, Jozefien, et al.
Published: (2025)
by: D'haeseleer, Jozefien, et al.
Published: (2025)
Graph rigidity properties of Ramanujan graphs
by: Cioabă, Sebastian M., et al.
Published: (2022)
by: Cioabă, Sebastian M., et al.
Published: (2022)
Maximal independent sets in the middle two layers of the Boolean lattice
by: Balogh, József, et al.
Published: (2025)
by: Balogh, József, et al.
Published: (2025)
On the largest independent sets in the Kneser graph on chambers of PG(4,q)
by: Heering, Philipp
Published: (2024)
by: Heering, Philipp
Published: (2024)
Quotient graphs and stochastic matrices
by: Cançado, Frederico, et al.
Published: (2024)
by: Cançado, Frederico, et al.
Published: (2024)
A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
by: Tóthmérész, Lilla
Published: (2022)
by: Tóthmérész, Lilla
Published: (2022)
Sharp bounds for covering with large cliques and independent sets
by: Bitonti, Veronica, et al.
Published: (2026)
by: Bitonti, Veronica, et al.
Published: (2026)
$n^2 + 1$ unit equilateral triangles cannot cover an equilateral triangle of side $> n$ if all triangles have parallel sides
by: Baek, Jineon, et al.
Published: (2023)
by: Baek, Jineon, et al.
Published: (2023)
Private neighbors, perfect codes and their relation with the $\mathtt{v}$-number of closed neighborhood ideals
by: Jaramillo-Velez, Delio, et al.
Published: (2026)
by: Jaramillo-Velez, Delio, et al.
Published: (2026)
The polytope of all matroids in ranks 2 and 3
by: Collins, Narayan, et al.
Published: (2026)
by: Collins, Narayan, et al.
Published: (2026)
A new axiom system for matroids: 1. Uniform matroid recognition
by: Chaourar, Brahim
Published: (2017)
by: Chaourar, Brahim
Published: (2017)
Matroid polytopes with small rank
by: Konoike, Masato, et al.
Published: (2025)
by: Konoike, Masato, et al.
Published: (2025)
The intersection density of cubic arc-transitive graphs with $2$-arc-regular full automorphism group equal to $\operatorname{PGL}_2(q)$
by: Meagher, Karen, et al.
Published: (2025)
by: Meagher, Karen, et al.
Published: (2025)
Distribution of independent sets in perfect $r$-ary trees
by: Iľkovič, Daniel, et al.
Published: (2026)
by: Iľkovič, Daniel, et al.
Published: (2026)
Linear recurrences for non-log-concave independence polynomials of trees
by: Bautista-Ramos, César, et al.
Published: (2026)
by: Bautista-Ramos, César, et al.
Published: (2026)
Improved lower bounds for the maximum order of an induced acyclic subgraph
by: Asgarli, Shamil, et al.
Published: (2025)
by: Asgarli, Shamil, et al.
Published: (2025)
Reconstructing a graph from its Bell colouring graph
by: Hearn, Brian
Published: (2026)
by: Hearn, Brian
Published: (2026)
Number of independent transversals in multipartite graphs
by: Tang, Yantao, et al.
Published: (2025)
by: Tang, Yantao, et al.
Published: (2025)
Piercing all maximum cliques in hypergraphs
by: Holmsen, Andreas, et al.
Published: (2026)
by: Holmsen, Andreas, et al.
Published: (2026)
A Regular Unimodular Triangulation of the Matroid Base Polytope
by: Backman, Spencer, et al.
Published: (2023)
by: Backman, Spencer, et al.
Published: (2023)
Dual Linear Programming Bounds for Sphere Packing via Discrete Reductions
by: Li, Rupert
Published: (2022)
by: Li, Rupert
Published: (2022)
Common neighbours in planar graphs
by: Maffucci, Riccardo W.
Published: (2025)
by: Maffucci, Riccardo W.
Published: (2025)
Lexicographic Extensions preserve Euclideaness
by: Hochstättler, Winfried, et al.
Published: (2025)
by: Hochstättler, Winfried, et al.
Published: (2025)
Vertex-shellings of Euclidean Oriented Matroids
by: Hochstättler, Winfried, et al.
Published: (2023)
by: Hochstättler, Winfried, et al.
Published: (2023)
The $18\cdot 2^t+1$ Triangle-Maximal Series of Straight Lines
by: Parpalak, Roman, et al.
Published: (2026)
by: Parpalak, Roman, et al.
Published: (2026)
Self-avoiding space-filling folding curves in dimension 3
by: Oger, Francis
Published: (2025)
by: Oger, Francis
Published: (2025)
Hamiltonian Cycles in Simplicial and Supersolvable Hyperplane Arrangements
by: Körber, Veronika, et al.
Published: (2025)
by: Körber, Veronika, et al.
Published: (2025)
Constructions for positional games and applications to domination games
by: Bagdas, Ali Deniz, et al.
Published: (2025)
by: Bagdas, Ali Deniz, et al.
Published: (2025)
Perfect precise colorings of plane semiregular tilings
by: Loquias, Manuel Joseph C., et al.
Published: (2023)
by: Loquias, Manuel Joseph C., et al.
Published: (2023)
Global Rigidity of Triangulated Manifolds
by: Cruickshank, James, et al.
Published: (2022)
by: Cruickshank, James, et al.
Published: (2022)
Log-concavity of the independence polynomials of $\mathbf{W}_{p}$ graphs
by: Hoang, Do Trong, et al.
Published: (2024)
by: Hoang, Do Trong, et al.
Published: (2024)
On $\{k\}$-Roman graphs: complexity of recognition and the case of split graphs
by: Štorgel, Kenny Bešter, et al.
Published: (2025)
by: Štorgel, Kenny Bešter, et al.
Published: (2025)
Ext operators for wreath Macdonald polynomials
by: Ferlinc, Seamus Albion, et al.
Published: (2025)
by: Ferlinc, Seamus Albion, et al.
Published: (2025)
The family of all local maximum independent sets is an augmentoid
by: Levit, Vadim E., et al.
Published: (2026)
by: Levit, Vadim E., et al.
Published: (2026)
Sparse graphs with an independent or foresty minimum vertex cut
by: Cheng, Kun, et al.
Published: (2024)
by: Cheng, Kun, et al.
Published: (2024)
The number of edges of a symmetric edge polytope
by: Codenotti, Giulia, et al.
Published: (2025)
by: Codenotti, Giulia, et al.
Published: (2025)
Similar Items
-
Identifying contact graphs of sphere packings with generic radii
by: Dewar, Sean
Published: (2023) -
Veronese polytopes: Extending the framework of cyclic polytopes
by: Brandenburg, Marie-Charlotte, et al.
Published: (2024) -
No-three-in-line sets on the checkerboard grid
by: Prellberg, Thomas
Published: (2026) -
Transitive $(q-1)$-fold packings of $\rm{PG}_n(q)$
by: Hawtin, Daniel R.
Published: (2024) -
On the Chromatic Number of Grassmann Graphs
by: D'haeseleer, Jozefien, et al.
Published: (2025)