On the Structure of Graphs With Few P4s

We present new classes of graphs for which the isomorphism problem can be solved in polynomial time. These graphs are characterized by containing — in some local sense — only a small number of induced paths of length three. As it turns out, every such graph has a unique tree representation: the internal nodes correspond to three types of graph operations, while the leaves are basic graphs with a simple structure. The paper extends and generalizes known results about cographs, P4-reducible graphs, and P4-sparse graphs

Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes

Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case analysis. We introduce a novel and general search strategy that branches on the forbidden subgraphs of a graph class relaxation. By using the class of $P_4$-sparse graphs as the relaxed graph class, we obtain efficient bounded search tree algorithms for several parameterized deletion problems. We give the first non-trivial bounded search tree algorithms for the cograph edge-deletion problem and the trivially perfect edge-deletion problems. For the cograph vertex deletion problem, a refined analysis of the runtime of our simple bounded search algorithm gives a faster exponential factor than those algorithms designed with the help of complicated case distinctions and non-trivial running time analysis [21] and computer-aided branching rules [11].Comment: 23 pages. Accepted in Discrete Mathematics, Algorithms and Applications (DMAA

An approximate version of the Loebl-Komlos-Sos conjecture

Loebl, Komlos, and Sos conjectured that if at least half of the vertices of a graph G have degree at least some natural number k, then every tree with at most k edges is a subgraph of G. Our main result is an approximate version of this conjecture for large enough n=|V(G)|, assumed that n=O(k). Our result implies an asymptotic bound for the Ramsey number of trees. We prove that r(T_k,T_m)\leq k+m+o(k+m),as k+m tends to infinity.Comment: 29 pages, 6 figures, referees' comments incorporate

Recognition of some perfectly orderable graph classes

AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable graphs. Bipolarizable and P4-simplicial graphs are recognized in O(n3.376) time, improving the previous bounds of O(n4) and O(n5), respectively. Brittle and semi-simplicial graphs are recognized in O(n3) time using a randomized algorithm, and O(n3log2n) time if a deterministic algorithm is required. The best previous time bound for recognizing these classes of graphs is O(m2). Welsh–Powell opposition graphs are recognized in O(n3) time, improving the previous bound of O(n4). HHP-free graphs and maxibrittle graphs are recognized in O(mn) and O(n3.376) time, respectively

Representation of graphs by OBDDs

AbstractRecently, it has been shown in a series of works that the representation of graphs by Ordered Binary Decision Diagrams (OBDDs) often leads to good algorithmic behavior. However, the question for which graph classes an OBDD representation is advantageous, has not been investigated, yet. In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P4s, unit interval graphs, interval graphs and bipartite graphs are investigated. Upper and lower bounds are proven for all these graph classes and it is shown that in most (but not all) cases a representation of the graphs by OBDDs is advantageous with respect to space requirements

Charmed and light pseudoscalar meson decay constants from four-flavor lattice QCD with physical light quarks

We compute the leptonic decay constants fD+, fDs, and fK+ and the quark-mass ratios mc/ms and ms/ml in unquenched lattice QCD using the experimentally determined value of fπ+ for normalization. We use the MILC highly improved staggered quark ensembles with four dynamical quark flavors—up, down, strange, and charm—and with both physical and unphysical values of the light sea-quark masses. The use of physical pions removes the need for a chiral extrapolation, thereby eliminating a significant source of uncertainty in previous calculations. Four different lattice spacings ranging from a≈0.06 to 0.15 fm are included in the analysis to control the extrapolation to the continuum limit. Our primary results are fD+=212.6(0.4)(+1.0−1.2)  MeV, fDs=249.0(0.3)(+1.1−1.5)  MeV, and fDs/fD+=1.1712(10)(+29−32), where the errors are statistical and total systematic, respectively. The errors on our results for the charm decay constants and their ratio are approximately 2–4 times smaller than those of the most precise previous lattice calculations. We also obtain fK+/fπ+=1.1956(10)(+26−18), updating our previous result, and determine the quark-mass ratios ms/ml=27.35(5)(+10−7) and mc/ms=11.747(19)(+59−43). When combined with experimental measurements of the decay rates, our results lead to precise determinations of the Cabibbo-Kobayashi-Maskawa matrix elements |Vus|=0.22487(51)(29)(20)(5), |Vcd|=0.217(1)(5)(1) and |Vcs|=1.010(5)(18)(6), where the errors are from this calculation of the decay constants, the uncertainty in the experimental decay rates, structure-dependent electromagnetic corrections, and, in the case of |Vus|, the uncertainty in |Vud|, respectively

Characterising and recognising game-perfect graphs

Consider a vertex colouring game played on a simple graph with $k$ permissible colours. Two players, a maker and a breaker, take turns to colour an uncoloured vertex such that adjacent vertices receive different colours. The game ends once the graph is fully coloured, in which case the maker wins, or the graph can no longer be fully coloured, in which case the breaker wins. In the game $g_B$, the breaker makes the first move. Our main focus is on the class of $g_B$-perfect graphs: graphs such that for every induced subgraph $H$, the game $g_B$ played on $H$ admits a winning strategy for the maker with only $\omega(H)$ colours, where $\omega(H)$ denotes the clique number of $H$. Complementing analogous results for other variations of the game, we characterise $g_B$-perfect graphs in two ways, by forbidden induced subgraphs and by explicit structural descriptions. We also present a clique module decomposition, which may be of independent interest, that allows us to efficiently recognise $g_B$-perfect graphs.Comment: 39 pages, 8 figures. An extended abstract was accepted at the International Colloquium on Graph Theory (ICGT) 201