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

推荐订阅源

F
Fortinet All Blogs
C
Check Point Blog
GbyAI
GbyAI
博
博客园 - 司徒正美
爱范儿
爱范儿
N
Netflix TechBlog - Medium
H
Hacker News: Front Page
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
Security Latest
Security Latest
C
Cyber Attacks, Cyber Crime and Cyber Security
博
博客园 - Franky
Recent Announcements
Recent Announcements
P
Privacy International News Feed
T
Tor Project blog
Y
Y Combinator Blog
有赞技术团队
有赞技术团队
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
G
GRAHAM CLULEY
The Hacker News
The Hacker News
N
News and Events Feed by Topic
I
Intezer
The GitHub Blog
The GitHub Blog
S
SegmentFault 最新的问题
T
The Blog of Author Tim Ferriss
PCI Perspectives
PCI Perspectives
S
Secure Thoughts
P
Proofpoint News Feed
Microsoft Security Blog
Microsoft Security Blog
IT之家
IT之家
T
Threat Research - Cisco Blogs
J
Java Code Geeks
钛媒体：引领未来商业与生活新知
钛媒体：引领未来商业与生活新知
D
DataBreaches.Net
Hacker News - Newest:
Hacker News - Newest: "LLM"
Last Week in AI
Last Week in AI
H
Help Net Security
L
LangChain Blog
大猫的无限游戏
大猫的无限游戏
Help Net Security
Help Net Security
S
Schneier on Security
T
The Exploit Database - CXSecurity.com
Google Online Security Blog
Google Online Security Blog
Cyberwarzone
Cyberwarzone
T
Tailwind CSS Blog
V
Vulnerabilities – Threatpost
Forbes - Security
Forbes - Security
Apple Machine Learning Research
Apple Machine Learning Research
O
OpenAI News
AWS News Blog
AWS News 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}}$ 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
Maximum diameter of $3$- and $4$-colorable graphs
Éva Czabarka, Stephen J. Smith, László Székely · 2021-09-29 · via math.CO updates on arXiv.org

P. Erdős, J. Pach, R. Pollack, and Z. Tuza [J. Combin. Theory, B 47 (1989), 279--285] made conjectures for the maximum diameter of connected graphs without a complete subgraph $K_{k+1}$, which have order $n$ and minimum degree $δ$. Settling a weaker version of a problem, by strengthening the $K_{k+1}$-free condition to $k$-colorable, we solve the problem for $k=3$ and $k=4$ using a unified linear programming duality approach. The case $k=4$ is a substantial simplification of the result of É. Czabarka, P. Dankelmann, and L. A. Székely [Europ. J. Comb., 30 (2009), 1082--1089].

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