Minimum-weight edge discriminators in hypergraphs
From MaRDI portal
Publication:405305
zbMath1300.05193arXiv1210.4668MaRDI QIDQ405305
Bhaswar B. Bhattacharya, Shirshendu Ganguly, Sayantan Das
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.4668
Hypergraphs (05C65) Combinatorial optimization (90C27) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum-weight edge discriminators in hypergraphs
- Sidon sets in \(\mathbb N^d\)
- Irregularity strength of regular graphs
- An improved lower bound on the greatest element of a sum-distinct set of fixed order
- Theorems in the additive theory of numbers
- A remark on \(B_{2k}\)-sequences
- A construction for sets of integers with distinct subset sums
- A dynamic survey of graph labeling
- Integer sets with prescribed pairwise differences being distinct
- Irregular networks, regular graphs and integer matrices with distinct row and column sums
- Siegel's Lemma and sum-distinct sets
- A complete annotated bibliography of work related to Sidon sequences
- A New Upper Bound for the Irregularity Strength of Graphs
- Integer Sets with Distinct Subset-Sums
- A Tight Bound on the Irregularity Strength of Graphs
- Sets of Integers Whose Subsets Have Distinct Sums
- B h [ g sequences]
- On graph irregularity strength
- Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
- An inequality for B2-sequences
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- New upper bounds for finite \(B_h\) sequences
This page was built for publication: Minimum-weight edge discriminators in hypergraphs
