Sum-distinguishing number of sparse hypergraphs
From MaRDI portal
Publication:6171496
DOI10.1016/j.ejc.2023.103712zbMath1519.05182arXiv2102.02487OpenAlexW3128694373MaRDI QIDQ6171496
Yair Caro, Raphael Yuster, Maria A. Axenovich
Publication date: 18 July 2023
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.02487
Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Density (toughness, etc.) (05C42)
Related Items
Cites Work
- A note on adjacent vertex distinguishing colorings of graphs
- On edge irregularity strength of graphs
- Minimum-weight edge discriminators in hypergraphs
- Additive coloring of planar graphs
- Irregular weighting of 1-designs
- A construction for sets of integers with distinct subset sums
- A dynamic survey of graph labeling
- Integer sets with prescribed pairwise differences being distinct
- Siegel's Lemma and sum-distinct sets
- Random Hypergraph Irregularity
- A New Upper Bound for the Irregularity Strength of Graphs
- Solving a linear equation in a set of integers I
- A Tight Bound on the Irregularity Strength of Graphs
- On the Irregularity Strength of Dense Graphs
- A Note on the Erdös Distinct Subset Sums Problem
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
