The 1-2-3-conjecture for hypergraphs

DOI10.1002/JGT.22100MaRDI QIDQ4978298zbMATH OpenOpenAlexWikidataFDO

Authors Maciej Kalkowski, Michal Karonski, Florian Pfender

Publication date 8 August 2017

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1308.0611

zbMATH Keywords

irregular hypergraph labelings

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees. In this paper we show that such a weighting is possible from the weight set {1,2,...,r+1} for all hypergraphs with maximum edge size r>3 and not containing edges solely consisting of identical vertices. The number r+1 is best possible for this statement. Further, the weight set {1,2,3,4,5} is sufficient for all hypergraphs with maximum edge size 3, up to some trivial exceptions.

Recommendations

• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
• Weight choosability of oriented hypergraphs
• Vertex-colouring edge-weightings
• On the total versions of 1-2-3-conjecture for graphs and hypergraphs

Cites work

• Combinatorial Nullstellensatz
• Edge weights and vertex colours
• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• On a 1,2 conjecture
• The Even Cycle Problem for Directed Graphs
• Total weight choosability of graphs
• Total weight choosability of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
• Weight choosability of graphs

Cited in

(15)

• On offset Hamilton cycles in random hypergraphs
• Going wide with the 1-2-3 conjecture
• From the 1-2-3 conjecture to the Riemann hypothesis
• A lower bound and several exact results on the \(d\)-lucky number
• Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
• Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
• Vertex-coloring edge-weighting of complete r-partite graphs
• scientific article; zbMATH DE number 5139441 (Why is no real title available?)
• Minimum-weight edge discriminators in hypergraphs
• The 1‐2‐3‐conjecture holds for dense graphs
• Weight choosability of oriented hypergraphs
• On the total versions of 1-2-3-conjecture for graphs and hypergraphs
• A solution to the 1-2-3 conjecture
• The 1-2 conjecture holds for regular graphs
• On 1-2-3 conjecture-like problems in 2-edge-coloured graphs

This page was built for publication: The 1-2-3-conjecture for hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978298)