A Note on Edge Coloring of Linear Hypergraphs

被引：0
|
作者：
Qi WANG [1 ]
Xia ZHANG [1 ]
机构：
[1] School of Mathematics and Statistics, Shandong Normal University
来源：
JournalofMathematicalResearchwithApplications | 2023年 / 43卷 / 05期
基金：
中国国家自然科学基金;
关键词：
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
摘要：
A k-edge coloring of a hypergraph H is a coloring of the edges of H with k colors such that any two intersecting edges receive distinct colors. The Erdos-Faber-Lovasz conjecture states that every loopless linear hypergraph with n vertices has an n-edge coloring. In 2021,Kang, Kelly, K¨uhn, Methuku and Osthus confirmed the conjecture for sufficiently large n. In this paper, the conjecture is verified for collision-weak hypergraphs. This result strictly extends two related ones of Bretto, Faisant and Hennecart in 2020.
引用
收藏
页码：535 / 541
页数：7
相关论文
共 50 条
  • [1] Edge-coloring linear hypergraphs with medium-sized edges
    Faber, Vance
    Harris, David G.
    RANDOM STRUCTURES & ALGORITHMS, 2019, 55 (01) : 153 - 159
  • [2] Coloring hypergraphs with bounded cardinalities of edge intersections
    Akhmejanova, Margarita
    Shabanov, Dmitry
    DISCRETE MATHEMATICS, 2020, 343 (04)
  • [3] A Note on Random Greedy Coloring of Uniform Hypergraphs
    Cherkashin, Danila D.
    Kozik, Jakub
    RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (03) : 407 - 413
  • [4] COLORING UNIFORM HYPERGRAPHS WITH SMALL EDGE DEGREES
    Kostochka, Alexandr V.
    Kumbhat, Mohit
    Roedl, Vojtech
    FETE OF COMBINATORICS AND COMPUTER SCIENCE, 2010, 20 : 213 - +
  • [5] USE OF ALTERNATING CHAINS AND HYPERGRAPHS IN EDGE COLORING
    WERRA, DD
    JOURNAL OF GRAPH THEORY, 1979, 3 (02) : 175 - 182
  • [6] Edge-coloring of 3-uniform hypergraphs
    Obszarski, Pawel
    Jastrzebski, Andrzej
    DISCRETE APPLIED MATHEMATICS, 2017, 217 : 48 - 52
  • [7] EDGE-COLORING OF COMPLETE HYPERGRAPHS .1.
    BARANYAI, Z
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1979, 26 (03) : 276 - 294
  • [8] A note on the simultaneous edge coloring
    Bousquet, Nicolas
    Durain, Bastien
    DISCRETE MATHEMATICS, 2020, 343 (05)
  • [9] Edge coloring complete uniform hypergraphs with many components
    Caro, Y
    Yuster, R
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 91 (02) : 215 - 227
  • [10] A Note on Edge Coloring of Graphs
    Akbari, S.
    Iradmusa, M. N.
    Jamaali, M.
    ARS COMBINATORIA, 2015, 119 : 289 - 292
12345