The union-closed sets conjecture almost holds for almost all random bipartite graphs

Frankl’s union-closed sets conjecture states that in every finite union-closed 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 that, for every fixed edge-probability, almost every random bipartite graph almost satisfies Frankl’s conjecture.     

Cycles with a chord are graceful

In this paper, we prove that every cycle plus a chord is graceful, thus answering a conjecture of R. Bodendiek, H. Schumacher, and H. Wegner.     

Images of simple lattice polynomials

Although lattice polynomials, built from the two binary lattice operations and involving constants of the lattice, are mechanical devices to produce isotone self-maps, there is no order-theoretical property common to all lattice polynomial images. This contrasts with the current fact that little is known about isotone self-maps whose images are not, themselves, lattices. It also shuts out an obvious approach to the conjecture that every order polynomial complete lattice is finite.Presented by R. Freese.     

Invariants de Vassiliev et conjecture de PoincaréVassiliev invariants and the Poincaré conjecture

We prove the following result: if Vassiliev invariants distinguish knots in each homotopy sphere, then the Poincaré conjecture is true, in other words every homotopy sphere is homeomorphic to the standard sphere. On the other hand, in every Whitehead manifold there exist knots that cannot be distinguished by Vassiliev invariants. To cite this article: M. Eisermann, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 1005–1010.     

Quantum solvable algebras. Ideals and representations at roots of 1

Let R be a quantum solvable algebra. It is proved that every prime ideal I of R which is stable with respect to the quantum adjoint action is completely prime, and Fract(R/I) is isomorphic to the skew field of fractions of an algebra of twisted polynomials. We study the correspondence between symplectic leaves and irreducible representations. A conjecture of De Concini-Kac-Procesi on the dimension of irreducible representations is proved for sufficiently large l.     

A disjoint disks property for 3-manifolds

We show that the map separation property (MSP), a concept due to H.W. Lambert and R.B. Sher, is an appropriate analogue of J.W. Cannon’s disjoint disks property (DDP) for the class $\text{C}$ of compact generalized 3-manifolds with zero-dimensional singular set, modulo the Poincaré conjecture. Our main result is that the Poincaré conjecture (in dimension three) is equivalent to the conjecture that every X?$\text{C}$ with the MSP is a topological 3-manifold.     

Cycle‐Continuous Mappings—Order Structure

Given two graphs, a mapping between their edge‐sets is cycle‐continuous , if the preimage of every cycle is a cycle. The motivation for this definition is Jaeger's conjecture that for every bridgeless graph there is a cycle‐continuous mapping to the Petersen graph, which, if solved positively, would imply several other important conjectures (e.g., the Cycle double cover conjecture). Answering a question of DeVos, Ne?et?il, and Raspaud, we prove that there exists an infinite set of graphs with no cycle‐continuous mapping between them. Further extending this result, we show that every countable poset can be represented by graphs and the existence of cycle‐continuous mappings between them.     

叉连图的邻点可区别全染色

邻点可区别全染色猜想得到了国内外许多学者的关注和研究.迄今为止,这个猜想没有得到证明,也没有关于这个猜想的反例.叉连图对邻点可区别全染色猜想成立给予了证明,并给出了精确值.同时,证明了:存在无穷多个图,它们中的每一个图H至少包含一个真子图HH~1,使得x_as~″(H~1)x_as~″(H).     

Convergence of discrete analogues of a generalization of J.R. Haddock’s conjecture

This work focuses on the asymptotic behavior of solutions for a class of neutral delay difference equations, which are discrete analogues of a generalization of J.R. Haddock’s conjecture. It is shown that every bounded solution of the equations converges to a constant. Our results improve some known results from the literature.     

A counterexample to Valette’s conjecture

We disprove a well-known conjecture of D. Vallete (1978), which states that every d-dimensional self-affine convex body is a direct product of a polytope with a convex body of lower dimension. It is shown that there are counterexamples for dimension d = 4. Additional assumptions under which the conjecture is true are discussed.     

关于Reed列表染色猜想的一些结果

构造了一个图G,给G的每个顶点v一个颜色列表,使得每个列表Lv的大小至少为每个顶点v的邻域NG(v)与每个Vc交集的最大数目,但是这个图不存在一个正常的列表染色,从而推翻了R eed的一个猜想.     

The relative lengths of sides of convex hexagons and octagons

Doliwka and Lassak proved that every convex pentagon must have both relatively short and long sides and showed that there exist convex hexagons without any relatively short sides. They conjectured that every convex hexagon has a relatively long side. We prove that this conjecture is true. We also show that every convex octagon has a side whose relative length is at most 1 and this bound is asymptotically tight.     

The Sylvester-Chvatal Theorem

The Sylvester-Gallai theorem asserts that every finite set S of points in two-dimensional Euclidean space includes two points, a and b, such that either there is no other point in S on the line ab, or the line ab contains all the points in S. Chvatal extended the notion of lines to arbitrary metric spaces and made a conjecture that generalizes the Sylvester-Gallai theorem. In the present article we prove this conjecture.     

Flows in 3-edge-connected bidirected graphs

It was conjectured by A. Bouchet that every bidirected graph which admits a nowhere-zero k-flow admits a nowhere-zero 6-flow. He proved that the conjecture is true when 6 is replaced by 216. O. Zyka improved the result with 6 replaced by 30. R. Xu and C. Q. Zhang showed that the conjecture is true for 6-edge-connected graph, which is further improved by A. Raspaud and X. Zhu for 4-edge-connected graphs. The main result of this paper improves Zyka’s theorem by showing the existence of a nowhere-zero 25-flow for all 3-edge-connected graphs.     

Intersections of Three Nilpotent Subgroups of Finite Groups

Siberian Mathematical Journal - Under study is the conjecture that for every three nilpotent subgroups A, B, and C of a finite group G there are elements x and y such that A ∩ Bx ∩ Cy...     

Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif

A tree is scattered if it does not contain a subdivision of the complete binary tree as a subtree. We show that every scattered tree contains a vertex, an edge, or a set of at most two ends preserved by every embedding of T. This extends results of Halin, Polat and Sabidussi. Calling two trees equimorphic if each embeds in the other, we then prove that either every tree that is equimorphic to a scattered tree T is isomorphic to T, or there are infinitely many pairwise non-isomorphic trees which are equimorphic to T. This proves the tree alternative conjecture of Bonato and Tardif for scattered trees, and a conjecture of Tyomkyn for locally finite scattered trees.     

Sphere packings, I

We describe a program to prove the Kepler conjecture on sphere packings. We then carry out the first step of this program. Each packing determines a decomposition of space into Delaunay simplices, which are grouped together into finite configurations called Delaunay stars. A score, which is related to the density of packings, is assigned to each Delaunay star. We conjecture that the score of every Delaunay star is at most the score of the stars in the face-centered cubic and hexagonal close packings. This conjecture implies the Kepler conjecture. To complete the first step of the program, we show that every Delaunay star that satisfies a certain regularity condition satisfies the conjecture.     

Almost all 5-regular graphs have a 3-flow

Tutte conjectured in 1972 that every 4-edge–connected graph has a nowhere-zero 3-flow. This has long been known to be equivalent to the conjecture that every 5-regular 4-edge–connected graph has an edge orientation in which every in-degree is either 1 or 4. We show that the assertion of the conjecture holds asymptotically almost surely for random 5-regular graphs. It follows that the conjecture holds for almost all 4-edge–connected 5-regular graphs.     

《关于K?the问题及幂零性问题》一文的注记

In the paper [1], Xu Yonghua has studied the necessary and sufficient condition for the K?the conjecture to be affirmed, for every one side nil ideal to he nilpotent, respectively. In this paper.it is proved that "The chains of the homomorphic left R modules are inductive on one of the K?the subsets" can he used instead of "The chains are inductive on every one of the K?the sub sets" in the paper [1],so Xu's results are improved.     

Pathwidth, trees, and random embeddings

We prove that, for every integer k≥1, every shortest-path metric on a graph of pathwidth k embeds into a distribution over random trees with distortion at most c=c(k), independent of the graph size. A well-known conjecture of Gupta, Newman, Rabinovich, and Sinclair [12] states that for every minor-closed family of graphs F, there is a constant c(F) such that the multi-commodity max-flow/min-cut gap for every flow instance on a graph from F is at most c(F). The preceding embedding theorem is used to prove this conjecture whenever the family F does not contain all trees.