完全单半群及完全正则半群的逆断面

指出完全单半群Ｓ的任何一个Ｆ－类是逆断面,且为Ｑ－逆断面,而Ｓ的任何一个逆断面必是一个Ｆ－类,因而所有逆断面同构。并且给出完全正则半群的逆断面存在的充要条件。     

具有某种断面的半群的研究进展

本文综述了几类具有特殊断面的半群的近期研究结果。在介绍逆半群和正则半群的一般结构之后，概述了具有逆断面的正则半群的结构和同余格的研究成果。总结了作为逆断面的推广的可裂断面，纯正断面，正则^*－断面和恰当断面。提出了可以进一步研究的重要的问题。     

具有拟理想正则*-断面的正则半群

本文提出了具有正则*-断面正则半群的概念，所给出的例子表明具有拟理想正则*-断面的正则半群类真包含了具有拟理想逆断面的正则半群类和正则*-半群类；最后刻画了具有拟理想正则*-断面的正则半群的结构．     

具有左单S-恰当断面的富足半群的结构(英文)

本文得到具有左单恰当断面的富足半群的进一步刻画.推广并丰富了Blyth和AlmeidaSantos于1996年得到的关于左单逆断面及两位作者分别于2008年与2010年得到的关于恰当断面的相关结果.建立了具有左单S-恰当断面的富足半群的结构.     

具有CO-恰当断面富足半群的一种构造方法

本文首先研究了具有可消模断面的拟恰当半群的结构,然后给出了用可消模断面的拟恰当半群构造具有CO-恰当断面富足半群的方法.     

具有E—逆断面的正则半群的结构定理

讨论了具有E－逆断面的正则半群的性质;并给出了具有E－逆断面的正则半群的一种结构定理。     

强P-正则半群上的最小正则＊-半群同余

主要研究了强P-正则半群S（P）上的最小正则＊-半群同余.利用S（P）的正则＊-断面S°得到S（P）上最小正则＊-半群同余的简单形式γP.由于S（P）/γP同构于S°,实质上S°是S（P）的最大正则＊-半群同态象,且S（P）的正则＊-断面不唯一,但从同意义上看正则＊-断面唯一.     

强ρ-正则半群上的最小正则*-半群同余

主要研究了强P-正则半群S(P)上的最小正则*-半群同余.利用S(P)的正则*-断面S°得到S(P)上最小正则*-半群同余的简单形式γP·由于S(P)/γp同构于S°,实质上S°是S(P)的最大正则*-半群同态象,且S(P)的正则*-断面不唯一,但从同意义上看正则*-断面唯一.     

具有Q-正则*-断面的正则半群上的*-同余格

文中给出了一个具有正则*-断面正则半群的例子,该半群同时存在非平凡*-同余和非平凡的非*-同余;证明了正则*-断面上的每个*-同余都能扩张成整个半群上的*-同余;刻划了*-同余和*-同余格;定义了*-同余格上的两个完全同余T*FS和T*S*;研究了*-同余格上的完全同余T*S*, T*, T*l, Tr, U*和V*, 给出了这些同余的类中的极值同余(除U*, V*外).     

具有正则*-断面的正则半群的结构

设S是一个正则半群,如果存在一个S的子半群S~*及上的一元运算*满足条件：(1)(?)x∈S,x~*∈S~*∩V(x)；(2)(?)x∈S~*,(x~*)~*=x；(3)(?)x,y∈S,(x~*y)~*=y~*x~(**),(xy~*)~*=y~(xx)x~*则称S~*是S的一个正则*_-断面．本文刻画了具有正则*_-断面的正则半群的结构。     

Quasi-Type δ Semigroups with an Adequate Transversal

In this paper,some properties of quasi-type δ semigroups with an adequate transversal are explored.In particular,abundant semigroups with a cancellative transversal are characterized.Our results genera...     

带恰当断面的拟-型$\delta$半群

In this paper,some properties of quasi-type δ semigroups with an adequate transversal are explored.In particular,abundant semigroups with a cancellative transversal are character-ized.Our results generalize and enrich Saito＇s results on quasi-orthodox semigroups with an inverse transversal.     

Bounded transversals in multipartite graphs

Transversals in r‐partite graphs with various properties are known to have many applications in graph theory and theoretical computer science. We investigate f‐bounded transversal s (or f‐BT), that is, transversals whose connected components have order at most f. In some sense we search for the sparsest f‐BT‐free graphs. We obtain estimates on the smallest maximum degree that 3‐partite and 4‐partite graphs without 2‐BT can have and provide a greatly simplified proof of the best known general lower bound on the smallest maximum degree in f‐BT‐free graphs. © 2011 Wiley Periodicals, Inc. J Graph Theory.     

Eigenvalues of ‐Free Graphs and the Connectivity of Their Independence Complexes

Let G be a graph on n vertices, with maximal degree d, and not containing as an induced subgraph. We prove:

• 1.
• 2.

Here is the maximal eigenvalue of the Laplacian of G, is the independence complex of G, and denotes the topological connectivity of a complex plus 2. These results provide improved bounds for the existence of independent transversals in ‐free graphs.     

Self-duality of bounded monotone boolean functions and related problems

In this paper we examine the problem of determining the self-duality of a monotone boolean function in disjunctive normal form (DNF). We show that the self-duality of monotone boolean functions with n disjuncts such that each disjunct has at most k literals can be determined in O(2^k2k²n) time. This implies an O(n²logn) algorithm for determining the self-duality of -DNF functions. We also consider the version where any two disjuncts have at most c literals in common. For this case we give an O(n^4(c+1)) algorithm for determining self-duality.     

The union of minimal hitting sets: Parameterized combinatorial bounds and counting

A k-hitting set in a hypergraph is a set of at most k vertices that intersects all hyperedges. We study the union of all inclusion-minimal k-hitting sets in hypergraphs of rank r (where the rank is the maximum size of hyperedges). We show that this union is relevant for certain combinatorial inference problems and give worst-case bounds on its size, depending on r and k. For r=2 our result is tight, and for each r3 we have an asymptotically optimal bound and make progress regarding the constant factor. The exact worst-case size for r3 remains an open problem. We also propose an algorithm for counting all k-hitting sets in hypergraphs of rank r. Its asymptotic runtime matches the best one known for the much more special problem of finding one k-hitting set. The results are used for efficient counting of k-hitting sets that contain any particular vertex.     

Real -flats tangent to quadrics in

Let and denote the dimension and the degree of the Grassmannian , respectively. For each there are (a priori complex) -planes in tangent to general quadratic hypersurfaces in . We show that this class of enumerative problems is fully real, i.e., for there exists a configuration of real quadrics in (affine) real space so that all the mutually tangent -flats are real.

     

Total Domination in Graphs with Diameter 2

The total domination number of a graph G is the minimum cardinality of a set S of vertices, so that every vertex of G is adjacent to a vertex in S. In this article, we determine an optimal upper bound on the total domination number of a graph with diameter 2. We show that for every graph G on n vertices with diameter 2, . This bound is optimal in the sense that given any , there exist graphs G with diameter 2 of all sufficiently large even orders n such that .     

Relationships between total domination,order, size,and maximum degree of graphs

A total dominating set, S, in a graph, G, has the property that every vertex in G is adjacent to a vertex in S. The total dominating number, γ_t(G) of a graph G is the size of a minimum total dominating set in G. Let G be a graph with no component of size one or two and with Δ(G) ≥ 3. In 6 , it was shown that |E(G)| ≤ Δ(G) (|V(G)|–γ_t(G)) and conjectured that |E(G)| ≤ (Δ(G)+3) (|V(G)|–γ_t(G))/2 holds. In this article, we prove that holds and that the above conjecture is false as there for every Δ exist Δ‐regular bipartite graphs G with |E(G)| ≥ (Δ+0.1 ln(Δ)) (|V(G)|–γ_t(G))/2. The last result also disproves a conjecture on domination numbers from 8 . © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 325–337, 2007