惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

大猫的无限游戏
大猫的无限游戏
MyScale Blog
MyScale Blog
雷峰网
雷峰网
量子位
小众软件
小众软件
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 叶小钗
T
Tailwind CSS Blog
月光博客
月光博客
博客园 - 【当耐特】
博客园_首页
罗磊的独立博客
博客园 - 三生石上(FineUI控件)
IT之家
IT之家
爱范儿
爱范儿
阮一峰的网络日志
阮一峰的网络日志
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
WordPress大学
WordPress大学
The Cloudflare Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
S
SegmentFault 最新的问题
人人都是产品经理
人人都是产品经理
V
V2EX
酷 壳 – CoolShell
酷 壳 – CoolShell

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Peano partial cubes
2019-01-26 · via math.CO updates on arXiv.org

Peano partial cubes are the bipartite graphs whose geodesic interval spaces are (closed) join spaces. They are the partial cubes all of whose finite convex subgraphs have a pre-hull number which is at most 1. Special Peano partial cubes are median graphs, cellular bipartite graphs and netlike partial cubes. Analogous properties of these graphs are satisfied by Peano partial cubes. In particular the convex hull of any isometric cycle of such a graph is a gated quasi-hypertori (i.e., the Cartesian product of copies of K_2 and even cycles). Moreover, for any Peano partial cubes G that contains no isometric rays, there exists a finite qasi-hypertorus which is fixed by all automorphisms of G, and any self-contraction of G fixes some finite quasi-hypertorus. A Peano partial cube G is called a hyper-median partial cube if any triple of vertices of has either a median or a hyper-median, that is, a quasi-median whose convex-hull induces a hypertorus (i.e., the Cartesian product of even cycles such that at least one of them has length greater than 4). These graphs have several properties similar to that of median graphs. In particular a graph is a hyper-median partial cube if and only if all its finite convex subgraphs are obtained by successive gated amalgamations from finite quasi-hypertori. Also a finite graph is a hyper-median partial cube if and only if it can be obtained from K_1 by a sequence of special expansions. The class of Peano partial cubes and that of hyper-median partial cubes are closed under convex subgraphs, retracts, Cartesian products and gated amalgamations. We study two convex invariants: the Helly number of a Peano partial cube, and the depth of a hyper-median partial cube that contains no isometric rays. Finally, for a finite Peano partial cube G, we prove an Euler-type formula, and a similar formula giving the isometric dimension of G.