The 1–2–3 Conjecture almost holds for regular graphs
نویسندگان
چکیده
The well-known 1–2–3 Conjecture asserts that the edges of every graph without isolated can be weighted with 1, 2 and 3 so adjacent vertices receive distinct degrees . This is open in general, while it known to possible from weight set { 1 , 4 5 } We show for regular graphs sufficient use weights 2, 3, 4. Moreover, we prove conjecture hold d -regular ≥ 10 8
منابع مشابه
MEYNIEL’S CONJECTURE HOLDS FOR RANDOM d-REGULAR GRAPHS
Abstract. In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most C p|V (G)|. In a separate ...
متن کاملThe union-closed sets conjecture almost holds for almost all random bipartite graphs
Frankl’s union-closed sets conjecture states that in every finite unionclosed family of sets, not all empty, there is an element in the ground set contained in at least half of the sets. The conjecture has an equivalent formulation in terms of graphs: In every bipartite graph with least one edge, both colour classes contain a vertex belonging to at most half of the maximal stable sets. We prove...
متن کاملMeyniel's conjecture holds for random graphs
In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most C √ |V (G)|. In this paper, we show ...
متن کاملAlmost Regular Sequences and the Monomial Conjecture
This conjecture has assumed a central role since it has a very simple statement and it implies several other important conjectures, notably the Canonical Element Conjecture, for rings of positive or mixed characteristic. In fact, when this conjecture was first announced, it had numerous further consequences, some of which, such as the New Intersection Conjecture, were proved later by different ...
متن کاملThe Merino-Welsh conjecture holds for series-parallel graphs
The Merino-Welsh conjecture asserts that the number of spanning trees of a graph is no greater than the maximum of the numbers of totally cyclic orientations and acyclic orientations of that graph. We prove this conjecture for the class of series-parallel graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2021
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2020.03.005