Correction to: Every Cubic Bipartite Graph has a Prime Labeling Except $$K_{3,3}$$
نویسندگان
چکیده
After publication of the research article named above, author discovered an error in proof main theorem that has a major impact on stated results. This erratum adds additional restriction to statements Lemma 7 and Theorem 1 from original greatly reduces scope those
منابع مشابه
Every Prime has a Succinct Certificate
To prove that a number n is composite, it suffices to exhibit the working for the multiplication of a pair of factors. This working, represented as a, string, is of length bounded by a polynomial in log n. We show that the same property holds for the primes. It is noteworthy that almost no other set is known to have the property thatshort proofs for membership or nonmembership exist for all can...
متن کاملEvery Odd Perfect Number Has a Prime Factor Which Exceeds
It is proved here that every odd perfect number is divisible by a prime greater than 106.
متن کاملEvery rayless graph has an unfriendly partition
We prove that every rayless graph has an unfriendly partition.
متن کاملGroups whose Bipartite Divisor Graph for Character Degrees Has Five Vertices
Let $G$ be a finite group and $cd^*(G)$ be the set of nonlinear irreducible character degrees of $G$. Suppose that $rho(G)$ denotes the set of primes dividing some element of $cd^*(G)$. The bipartite divisor graph for the set of character degrees which is denoted by $B(G)$, is a bipartite graph whose vertices are the disjoint union of $rho(G)$ and $cd^*(G)$, and a vertex $p in rho(G)$ is conne...
متن کاملLabeling the complete bipartite graph with no zero cycles
Maximally recoverable codes are codes designed for distributed storage which combine quick recovery from single node failure and optimal recovery from catastrophic failure. Gopalan et al [SODA 2017] studied the alphabet size needed for such codes in grid topologies and gave a combinatorial characterization for it. Consider a labeling of the edges of the complete bipartite graph Kn,n with labels...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2022
ISSN: ['1435-5914', '0911-0119']
DOI: https://doi.org/10.1007/s00373-022-02555-2