Results 71 to 80 of about 96,090 (258)
Conditional Randomization Tests for the Specification of Interference Structure
Journal of Applied Econometrics, EarlyView.ABSTRACT This study proposes specification tests for interference structure in causal inference with spillovers. We focus on experimental settings in which the treatment assignment mechanism is known. To test whether a given exposure mapping adequately summarizes the true interference structure, we develop conditional randomization tests by utilizing ...
Tadao Hoshino, Takahide Yanagi
wiley +1 more source
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch +5 more
wiley +1 more source
Completing partial packings of bipartite graphs
Journal of Combinatorial Theory, Series A, 2011 Given a bipartite graph $H$ and an integer $n$, let $f(n;H)$ be the smallest integer such that, any set of edge disjoint copies of $H$ on $n$ vertices, can be extended to an $H$-design on at most $n+f(n;H)$ vertices. We establish tight bounds for the growth of $f(n;H)$ as $n \rightarrow \infty$.
Zoltán Füredi +2 more
openaire +2 more sources
Linear Versus Centred Colouring via Pseudogrids
Journal of Graph Theory, EarlyView.ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique. For a graph G $G$, the centred chromatic number χ cen ( G ) ${\chi }_{\text{cen}}(G)$
Prosenjit Bose +4 more
wiley +1 more source
On the local distinguishing chromatic number
AKCE International Journal of Graphs and Combinatorics, 2019 The distinguishing number of graphs is generalized in two directions by Cheng and Cowen (local distinguishing number) and Collins and Trenk (Distinguishing chromatic number). In this paper, we define and study the local distinguishing chromatic number of
Omid Khormali
doaj +2 more sources
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
Journal of Graph Algorithms and Applications, 2014 A set D ⊆ V of a graph G = (V,E) is called an outer-connected dominating set of G if for all v ∈ V, |NG[v]∩D| ≥ 1, and the induced subgraph of G on V\D is connected.
B. Panda, Arti Pandey
doaj +1 more source
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
Journal of Graph Algorithms and Applications, 2020 Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings.
Patrizio Angelini +3 more
doaj +1 more source
Reconfiguring k-colourings of Complete Bipartite Graphs
, 2016 Let H be a graph, and k ≥ χ(H) an integer. We say that H has a cyclic Gray code of k-colourings if and only if it is possible to list all its k-colourings in such a way that consecutive colourings, including the last and the first, agree on all vertices ...
Marcel Celaya +3 more
semanticscholar +1 more source
A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs
Journal of Graph Theory, EarlyView.ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley +1 more source
Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley +1 more source