Cover Image

Proof of a conjecture on graph polytope

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Liu, Feihu
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Proofs of four generating function conjectures for arbor polytopes
by: Liu, Feihu, et al.
Published: (2026)

On conflict-free colorings of cyclic polytopes and the girth conjecture for graphs
by: Lee, Seunghun, et al.
Published: (2024)

Proof of a conjecture on eigenvalues of transposition graph
by: Ku, Cheng Yeaw, et al.
Published: (2025)

Proof of a Conjecture on Young Tableaux with Walls
by: Lin, Zhicong, et al.
Published: (2026)

The Frobenius problem for a class of quotients of numerical semigroups
by: Liu, Feihu
Published: (2026)

Generating functions for the quotients of numerical semigroups
by: Liu, Feihu
Published: (2023)

Proof of the strong conjecture about $F$-irregular graphs in the class of graphs $\{F\}$ of diameter $2$
by: Dovzhenok, Tatiana
Published: (2026)

Extremal spherical polytopes and Borsuk's conjecture
by: Katz, Mikhail, et al.
Published: (2023)

Proof a conjecture on connectivity keeping odd paths in k-connected bipartite graphs
by: Yang, Qing, et al.
Published: (2022)

Flow polytopes for extensions of bipartite graphs
by: Braun, Benjamin, et al.
Published: (2025)

Proof of a conjecture of Fomichev and Karev
by: Yan, Qi, et al.
Published: (2025)

Hadwiger's conjecture holds for strongly monotypic polytopes
by: Bui, Vuong
Published: (2024)

On quotients of numerical semigroups for almost arithmetic progressions
by: Liu, Feihu
Published: (2023)

Proof of the KAMAK tree conjecture
by: Christoph, Micha, et al.
Published: (2025)

Proof of a conjectured spectral upper bound on the chromatic number of a graph
by: Tang, Quanyu, et al.
Published: (2025)

MacMahon's $Ω_\geq$ operator: A computational framework
by: Liu, Feihu, et al.
Published: (2025)

Proof of a conjecture of Voss on bridges of longest cycles
by: Ma, Jie, et al.
Published: (2025)

Proof of a conjecture on isolation of graphs dominated by a vertex
by: Borg, Peter
Published: (2024)

Proof of a conjecture on isolation of graphs with a universal vertex
by: Borg, Peter, et al.
Published: (2025)

Proof of Frankl's conjecture on cross-intersecting families
by: Wu, Yongjiang, et al.
Published: (2024)

Proof of the Kohayakawa--Kreuter conjecture for the majority of cases
by: Bowtell, Candida, et al.
Published: (2023)

Volume inequalities for flow polytopes of full directed acyclic graphs
by: Braun, Benjamin, et al.
Published: (2024)

The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes
by: Christoph, Micha, et al.
Published: (2026)

Proof of Singh and Barman's conjecture on hook length biases
by: Lin, Hongshu, et al.
Published: (2025)

Proof of the Newell-Littlewood saturation conjecture
by: Min, Jaewon
Published: (2024)

A Fast Algorithm for Denumerants with Three Variables
by: Liu, Feihu, et al.
Published: (2024)

A Combinatorial Approach to Frobenius Numbers of Some Special Sequences (Complete Version)
by: Liu, Feihu, et al.
Published: (2023)

Proof of a conjecture on the shape-Wilf-equivalence for partially ordered patterns
by: Wang, Lintong, et al.
Published: (2025)

So's conjecture for integral circulant graphs of $4$ types
by: Li, Hao, et al.
Published: (2024)

Around the positive graph conjecture
by: Conlon, David, et al.
Published: (2024)

On Kotzig's conjecture in random graphs
by: Glock, Stefan, et al.
Published: (2025)

Proof of a conjecture of Bergeron, Ceballos and Labbé
by: Grinberg, Darij, et al.
Published: (2016)

Ehrhart Polynomials of Order Polytopes: Interpreting Combinatorial Sequences on the OEIS
by: Liu, Feihu, et al.
Published: (2024)

Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern
by: Liu, Feihu, et al.
Published: (2026)

The Sign Pattern Problem for Ehrhart Polynomials
by: Liu, Feihu, et al.
Published: (2025)

An $O(n\log^2n)$ Algorithm for Computing Hankel Determinants up to Order $n$
by: Liu, Feihu, et al.
Published: (2025)

Unimodular Equivalence of Integral Simplices
by: Liu, Feihu, et al.
Published: (2026)

A framework unifying some bijections for graphs and its connection to Lawrence polytopes
by: Ding, Changxin
Published: (2023)

Proof of Lovász conjecture for odd order
by: Nakanishi, Misa
Published: (2024)

On the Borodin--Kostochka conjecture for graphs with large maximum degree
by: Liu, Feng, et al.
Published: (2026)