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

推荐订阅源

I
InfoQ
D
DataBreaches.Net
Engineering at Meta
Engineering at Meta
GbyAI
GbyAI
Martin Fowler
Martin Fowler
Security Latest
Security Latest
Cisco Talos Blog
Cisco Talos Blog
MongoDB | Blog
MongoDB | Blog
D
Darknet – Hacking Tools, Hacker News & Cyber Security
IT之家
IT之家
cs.AI updates on arXiv.org
cs.AI updates on arXiv.org
S
Security Affairs
www.infosecurity-magazine.com
www.infosecurity-magazine.com
博
博客园_首页
L
LINUX DO - 最新话题
Know Your Adversary
Know Your Adversary
S
Schneier on Security
The Last Watchdog
The Last Watchdog
Attack and Defense Labs
Attack and Defense Labs
T
Tenable Blog
G
GRAHAM CLULEY
Y
Y Combinator Blog
P
Palo Alto Networks Blog
L
LINUX DO - 热门话题
Hugging Face - Blog
Hugging Face - Blog
W
WeLiveSecurity
C
Cybersecurity and Infrastructure Security Agency CISA
aimingoo的专栏
aimingoo的专栏
博
博客园 - 司徒正美
The Register - Security
The Register - Security
T
The Exploit Database - CXSecurity.com
MyScale Blog
MyScale Blog
M
MIT News - Artificial intelligence
Cyberwarzone
Cyberwarzone
雷峰网
雷峰网
T
Tailwind CSS Blog
V2EX - 技术
V2EX - 技术
T
Threat Research - Cisco Blogs
S
Secure Thoughts
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
O
OpenAI News
C
Cyber Attacks, Cyber Crime and Cyber Security
The Cloudflare Blog
量
量子位
Apple Machine Learning Research
Apple Machine Learning Research
T
Threatpost
S
SegmentFault 最新的问题
小众软件
小众软件
Google DeepMind News
Google DeepMind News
Help Net Security
Help Net Security

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}}$ Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them A superlinear improvement on line-free sets in $\mathbb{F}_p^3$ Central limit theorems for high dimensional lattice polytopes: cosmological polytopes Finding blowups one vertex at a time Maximum Probability of Independence in Transitive Matroids Higher Rank-Support Weights and q-Polymatroids Localized Turán-type inequalities for $Q$-index Functional codes arising from rank $n$ Hermitian varieties and hypersurfaces in low dimensions Generalizing OOOOOOB Complex Representations of Groups and Involutions of its Automorphisms Distributions of Iwasawa $λ$-invariants of $\mathbf{Z}_p$-towers over supersingular isogeny graphs The Closure of LCD-to-GI Reductions via Generalized Inner Products Sets of large values of polynomial multi-correlation functions Polylogarithmic Full-Chord Buffon Discrepancy Star-Shaped Integral Cartan-Type Matrices and an Egyptian-Fraction Classification of Affine Weighted Trees Symplectic lattice counting and zeta functions of higher Heisenberg groups Concise and elegant proofs of three formulas for complete Bell polynomials On Reed-Muller subcodes, Grassmannian partitions and sum-free functions Holographic functions and neural networks An Ore-type condition for $H$-tilings in graphs From Halin's Edge Removability to Matching Removability in $k$-Connected Graphs Reciprocals of Partition Polynomials A Comprehensive Study of Clique Graphs and Clique Regular Graphs Targeting Clause Type Distributions: a Picklock for Random Satisfiability Problems Hypercube geodesics with few colour changes Every signed planar graph is $5$-choosable: A short proof and refinements The Symmetries of Three-Layer ReLU Networks The Geometry of Cooperative Game Solutions: Stratified Egalitarian Shapley Values An Axiomatic Theory of Tie-Breaking: Impossibility, Characterization, and Decomposition Every Minimal Counterexample to the Erdős-Gyárfás Conjecture is Predominantly Cubic TriVAL: A Tri-Validation Framework for Faithful Automatic Optimization Modeling Learning Minimally Rigid Graphs with High Realization Counts Geometry of Rényi Entropy on the Majorization Lattice On $\ell$-weakly cross $t$-intersecting families for sets and vector spaces Invariant-Based Diagnostics for Graph Benchmarks Thresholds for Tic-Tac-Toe on Finite Affine Spaces Almost-Orthogonality in Lp Spaces: A Case Study with Grok On the Architectural Complexity of Neural Networks Most ReLU Networks Admit Identifiable Parameters A Partition-Based Generating Function for Row-Convex Polyominoes Word-Representability of Shift Graphs Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools The Banach-Butterfly Invariant: Influence-Adaptive Walsh Geometry for Ternary Polynomial Threshold Functions New Bounds for Zarankiewicz Numbers via Reinforced LLM Evolutionary Search Order-Sensitive Sequential Interventions on Ideal Lattices Mathematical Foundations for Peer-to-Peer Lattice Computation Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery A weighted angle distance on strings Achieving the Kesten-Stigum bound in the non-uniform hypergraph stochastic block model A Complete Symmetry Classification of Shallow ReLU Networks Ollivier-Ricci Curvature of Riemannian Manifolds and Directed Graphs with Applications to Graph Neural Networks Adaptive Threshold-Driven Continuous Greedy Method for Scalable Submodular Optimization A semicontinuous relaxation of Saito's criterion and freeness as angular minimization Representing Higher-Order Networks: A Survey of Graph-Based Frameworks Reinforced Generation of Combinatorial Structures: Ramsey Numbers Two Dimensional Subtraction -- Transfer Games Almost All Vectorial Functions Have Trivial Extended-Affine Stabilizers Split-Twin Extensions Preserving Seymour Vertices Three formulas for CSM classes of open quiver loci Möbius transforms and Shapley values for vector-valued functions on weighted directed acyclic multigraphs The existence of unexpected automorphisms in direct product graphs When are Hopf algebras determined by integer sequences? Self-affine quadrangles Pointwise order of generalized Hofstadter functions G, H and beyond Strong Embeddings of 3-Connected Cubic Planar Graphs on Surfaces of non-negative Euler Characteristic A Mathematical Reconstruction of Endothelial Cell Networks Progressive and Rushed Dyck Paths Symmetric noncrossing partitions of an annulus with double points Improved Bounds for Multicovering Hypergraphs The pre-Pieri rules
On the Packing Coloring Gap of Graphs
Batoul Tarhini, Didem Gözüpek · 2026-05-16 · via math.CO updates on arXiv.org

The packing chromatic number of a graph is the minimum number of colors for which the graph admits a packing coloring. This distance-based parameter may change under local structural modifications of the graph. In this paper, we introduce the packing coloring gap, defined as the maximum decrease in the packing chromatic number caused by the deletion of a single vertex. We focus on trees and determine the packing coloring gap for caterpillars. We further extend these results to caterpillars under the corona operation with K1. In addition, we present examples of graphs with packing coloring gap zero, one, and arbitrarily large.

此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。