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

推荐订阅源

博客园 - 聂微东
MyScale Blog
MyScale Blog
The GitHub Blog
The GitHub Blog
C
Check Point Blog
M
MIT News - Artificial intelligence
U
Unit 42
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
H
Help Net Security
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
D
DataBreaches.Net
大猫的无限游戏
大猫的无限游戏
D
Docker
Last Week in AI
Last Week in AI
IT之家
IT之家
F
Fortinet All Blogs
A
About on SuperTechFans
P
Proofpoint News Feed
The Cloudflare Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
B
Blog RSS Feed
博客园_首页
月光博客
月光博客
博客园 - 司徒正美
Y
Y Combinator Blog

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}}$
Extended Double Covers and Homomorphism Bounds of Signed ...
Florent Foucaud, Reza Naserasr, Rongxing Xu · 2021-10-27 · via math.CO updates on arXiv.org

A \emph{signed graph} $(G, σ)$ is a graph $G$ together with an assignment $σ:E(G) \rightarrow \{+,-\}$. The notion of homomorphisms of signed graphs is a relatively new development which allows to strengthen the connection between the theories of minors and colorings of graphs. Following this thread of thoughts, we investigate this connection through the notion of Extended Double Covers of signed graphs, which was recently introduced by Naserasr, Sopena and Zaslavsky. More precisely, we say that a signed graph $(B, π)$ is planar-complete if any planar signed graph $(G, σ)$ which verifies the conditions of a basic no-homomorphism lemma with respect to $(B,π)$ admits a homomorphism to $(B, π)$. Our conjecture then is that: if $(B, π)$ is a connected signed graph with no positive odd closed walk which is planar-complete, then its Extended Double Cover ${\rm EDC}(B,π)$ is also planar-complete. We observe that this conjecture largely extends the Four-Color Theorem and is strongly connected to a number of conjectures in extension of this famous theorem. A given (signed) graph $(B,π)$ \emph{bounds} a class of (signed) graphs if every (signed) graph in the class admits a homomorphism to $(B,π)$. In this work, and in support of our conjecture, we prove it for the subclass of signed $K_4$-minor free graphs. Inspired by this development, we then investigate the problem of finding optimal homomorphism bounds for subclasses of signed $K_4$-minor-free graphs with restrictions on their girth and we present nearly optimal solutions. Our work furthermore leads to the development of weighted signed graphs.