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

推荐订阅源

Recent Announcements
Recent Announcements
人人都是产品经理
人人都是产品经理
月光博客
月光博客
博客园 - 三生石上(FineUI控件)
GbyAI
GbyAI
博客园 - 司徒正美
美团技术团队
Vercel News
Vercel News
IT之家
IT之家
U
Unit 42
Y
Y Combinator Blog
罗磊的独立博客
Microsoft Security Blog
Microsoft Security Blog
MongoDB | Blog
MongoDB | Blog
Jina AI
Jina AI
V
Visual Studio Blog
B
Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
MyScale Blog
MyScale Blog
博客园 - 叶小钗
A
About on SuperTechFans
WordPress大学
WordPress大学
Hugging Face - Blog
Hugging Face - Blog
B
Blog RSS Feed

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}}$
The Fractional Haemers Bound of the Mycielski Construction
[Submitted on 13 Jul 2025 (v1), last revised 21 Jul 2026 (this v · 2025-07-14 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:We investigate the effect of the generalized Mycielski construction $M_r(G)$ on the complementary fractional Haemers bound $\bar{\mathcal{H}}_f(G; \mathbb{F})$, a parameter that depends on a graph $G$ and a field $\mathbb{F}$. The effect of the Mycielski construction on graph parameters has already been studied for the fractional chromatic number $\chi_f$ and the complementary Lovász theta number $\bar{\vartheta}$. Larsen, Propp, and Ullman provided a formula for $ \chi_f(M_2(G)) $ in terms of $\chi_f(G)$. This was later generalized by Tardif to $ \chi_f(M_r(G)) $ for any $r$, and Simonyi and the author gave a similar expression for $ \bar{\vartheta}(M_2(G)) $ in terms of $\bar{\vartheta}(G)$. In this paper, we show that Tardif's formula for the fractional chromatic number remains valid for $ \bar{\mathcal{H}}_f $ whenever $ \bar{\mathcal{H}}_f(G; \mathbb{F})$ equals the clique number of $G$. In particular, we provide a general upper bound on $\bar{\mathcal{H}}_f(M_r(G); \mathbb{F})$ in terms of $\bar{\mathcal{H}}_f(G;\mathbb{F})$ and we prove that this bound is tight whenever $ \bar{\mathcal{H}}_f(G; \mathbb{F})$ equals the clique number of $G$. Using the bounds, we present a general class of graphs for which the fractional Haemers bound of the generalized Mycielski construction can be determined exactly.

Submission history

From: Bence Csonka [view email]
[v1] Sun, 13 Jul 2025 22:02:27 UTC (16 KB)
[v2] Tue, 21 Jul 2026 09:16:24 UTC (16 KB)