The 1-2-3-conjecture for hypergraphs

DOI10.1002/JGT.22100zbMATH Open1367.05151arXiv1308.0611OpenAlexW2962946498WikidataQ123126385 ScholiaQ123126385MaRDI QIDQ4978298FDOQ4978298

Authors: Maciej Kalkowski, Michal Karonski, Florian Pfender 

Publication date: 8 August 2017

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

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.

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

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

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)

Cites Work

• Edge weights and vertex colours
• On a \(1,2\) conjecture
• Title not available (Why is that?)
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Combinatorial Nullstellensatz
• Total weight choosability of graphs
• Total weight choosability of graphs
• Weight choosability of graphs
• The Even Cycle Problem for Directed Graphs
• Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs

Cited In (13)

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

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)