On the threshold-width of graphs

The GG-width of a class of graphs GG is defined as follows. A graph G has GG-width k if there are k independent sets N1,...,Nk in G such that G can be embedded into a graph H in GG such that for every edge e in H which is not an edge in G, there exists an i such that both endpoints of e are in Ni. For the class TH of threshold graphs we show that TH-width is NP-complete and we present fixed-parameter algorithms. We also show that for each k, graphs of TH-width at most k are characterized by a finite collection of forbidden induced subgraphs

HH-product and HH-threshold graphs

This paper is the continuation of the research of the author and his colleagues of the {\it canonical} decomposition of graphs. The idea of the canonical decomposition is to define the binary operation on the set of graphs and to represent the graph under study as a product of prime elements with respect to this operation. We consider the graph together with the arbitrary partition of its vertex set into $n$ subsets ($n$-partitioned graph). On the set of $n$-partitioned graphs distinguished up to isomorphism we consider the binary algebraic operation $\circ_H$ ($H$-product of graphs), determined by the digraph $H$. It is proved, that every operation $\circ_H$ defines the unique factorization as a product of prime factors. We define $H$-threshold graphs as graphs, which could be represented as the product $\circ_{H}$ of one-vertex factors, and the threshold-width of the graph $G$ as the minimum size of $H$ such, that $G$ is $H$-threshold. $H$-threshold graphs generalize the classes of threshold graphs and difference graphs and extend their properties. We show, that the threshold-width is defined for all graphs, and give the characterization of graphs with fixed threshold-width. We study in detail the graphs with threshold-widths 1 and 2

Monotone properties of random geometric graphs have sharp thresholds

Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for this class of graphs have sharp thresholds by reducing the problem to bounding the bottleneck matching on two sets of $n$ points distributed uniformly in $[0,1]^d$. We present upper bounds on the threshold width, and show that our bound is sharp for $d=1$ and at most a sublogarithmic factor away for $d\ge2$. Interestingly, the threshold width is much sharper for random geometric graphs than for Bernoulli random graphs. Further, a random geometric graph is shown to be a subgraph, with high probability, of another independently drawn random geometric graph with a slightly larger radius; this property is shown to have no analogue for Bernoulli random graphs.Comment: Published at http://dx.doi.org/10.1214/105051605000000575 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Maximizing Happiness in Graphs of Bounded Clique-Width

Clique-width is one of the most important parameters that describes structural complexity of a graph. Probably, only treewidth is more studied graph width parameter. In this paper we study how clique-width influences the complexity of the Maximum Happy Vertices (MHV) and Maximum Happy Edges (MHE) problems. We answer a question of Choudhari and Reddy '18 about parameterization by the distance to threshold graphs by showing that MHE is NP-complete on threshold graphs. Hence, it is not even in XP when parameterized by clique-width, since threshold graphs have clique-width at most two. As a complement for this result we provide a $n^{\mathcal{O}(\ell \cdot \operatorname{cw})}$ algorithm for MHE, where $\ell$ is the number of colors and $\operatorname{cw}$ is the clique-width of the input graph. We also construct an FPT algorithm for MHV with running time $\mathcal{O}^*((\ell+1)^{\mathcal{O}(\operatorname{cw})})$, where $\ell$ is the number of colors in the input. Additionally, we show $\mathcal{O}(\ell n^2)$ algorithm for MHV on interval graphs.Comment: Accepted to LATIN 202

\order(\Gamma) Corrections to WW pair production in e+e−e^+e^- and γγ\gamma\gamma collisions

Several schemes to introduce finite width effects to reactions involving unstable elementary particles are given and the differences between them are investigated. The effects of the different schemes is investigated numerically for $W$ pair production. In $e^+e^-\to W^+W^-$ we find that the effect of the non-resonant graphs cannot be neglected for \sqrt{s}\geq400\GeV. There is no difference between the various schemes to add these to the resonant graphs away from threshold, although some violate gauge invariance. On the other hand, in the reaction $\gamma\gamma\to W^+W^-$ the effect of the non-resonant graphs is large everywhere, due to the $t$-channel pole. However, even requiring that the outgoing lepton is observable ($p_\perp > .02\sqrt{s}$) reduces the contribution to about 1\%. Again, the scheme dependence is negligible here.Comment: 9 pages plus 6 with figures (.uu at end, also available with anonymous ftp from pss058.psi.ch [129.129.40.58]), LaTeX, LMU-21/92, PSI-PR-93-05, TTP92-3

Top quark production in e+e- annihilation

We analyze the four-fermion reactions e+e- -> 4f containing a single top quark and three other fermions, a possible decay product of the resonant anti-top quark, in the final state. This allows us to estimate the contribution of the nonresonant Feynman graphs and effects related to the off mass shell production and decay of the top quark. We test the sensitivity of the total cross section at centre of mass energies in the t tbar threshold region and far above it to the variation of the top quark width. We perform calculation in an arbitrary linear gauge in the framework of the Standard Model and discuss an important issue of gauge symmetry violation by the constant top quark width.Comment: 9 pages, 2 figures. A revised version accepted for publication in the European Physical Journal C; a comment on the "fermion-loop scheme" modifie