Results 1 to 10 of about 79,195 (126)
Anticoncentration of Random Vectors via the Strong Perfect Graph Theorem [PDF]
Combinatorica, 2023 In this paper we give anticoncentration bounds for sums of independent random vectors in finite-dimensional vector spaces. In particular, we asymptotically establish a conjecture of Leader and Radcliffe (1994) and a question of Jones (1978). The highlight of this work is an application of the strong perfect graph theorem by Chudnovsky, Robertson ...
Juškevičius, Tomas +1 more
+6 more sources
The strong perfect graph theorem [PDF]
Annals of Mathematics, 2006 A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least 5 or the complement of one. The "strong perfect graph conjecture" (Berge, 1961) asserts that a graph is perfect if and only if it is Berge. A
Chudnovsky, Maria +3 more
+6 more sources
A semi-strong Perfect Graph theorem
Journal of Combinatorial Theory, Series B, 1987 The perfectness of a graph G was defined by Berge in 1961. He also proposed the following two conjectures: (1) G is perfect if and only if it contains no induced subgraph isomorphic to an odd cycle of length greater than three or the complement of such a cycle (strong perfect graph conjecture) and (2) G is perfect if and only if \(\bar G\) is perfect ...
Bruce Reed
openaire +3 more sources
The strong perfect graph theorem [PDF]
, 2019 Stephan Ramon Garcia, Steven Miller
openaire +2 more sources
Clique-Stable Set separation in perfect graphs with no balanced skew-partitions [PDF]
, 2016 Inspired by a question of Yannakakis on the Vertex Packing polytope of perfect graphs, we study the Clique-Stable Set Separation in a non-hereditary subclass of perfect graphs.
Lagoutte, Aurélie, Trunck, Théophile
core +5 more sources
Note on Perfect Forests in Digraphs [PDF]
, 2015 A spanning subgraph $F$ of a graph $G$ is called {\em perfect} if $F$ is a forest, the degree $d_F(x)$ of each vertex $x$ in $F$ is odd, and each tree of $F$ is an induced subgraph of $G$.
Bang-Jensen, Gutin, Scott
core +2 more sources
On Perfectness of Intersection Graph of Ideals of ℤn
Discussiones Mathematicae - General Algebra and Applications, 2017 In this short paper, we characterize the positive integers n for which intersection graph of ideals of ℤn is perfect.
Das Angsuman
doaj +1 more source
Local Search and the Evolution of World Models
Topics in Cognitive Science, EarlyView., 2023 Abstract An open question regarding how people develop their models of the world is how new candidates are generated for consideration out of infinitely many possibilities. We discuss the role that evolutionary mechanisms play in this process. Specifically, we argue that when it comes to developing a global world model, innovation is necessarily ...
Neil R. Bramley +3 more
wiley +1 more source
Interdiction Problems on Planar Graphs [PDF]
, 2013 Interdiction problems are leader-follower games in which the leader is allowed to delete a certain number of edges from the graph in order to maximally impede the follower, who is trying to solve an optimization problem on the impeded graph. We introduce
Pan, Feng, Schild, Aaron
core +1 more source
An Introduction to Predictive Processing Models of Perception and Decision‐Making
Topics in Cognitive Science, EarlyView., 2023 Abstract The predictive processing framework includes a broad set of ideas, which might be articulated and developed in a variety of ways, concerning how the brain may leverage predictive models when implementing perception, cognition, decision‐making, and motor control.
Mark Sprevak, Ryan Smith
wiley +1 more source