Results 151 to 160 of about 1,804,356 (287)
Journal of Graph Theory, EarlyView.ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley +1 more source
On the boundary Carrollian conformal algebra. [PDF]
Lett Math PhysBuzaglo L +5 more
europepmc +1 more source
Computing and drawing isomorphic subgraphs
, 2008 The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remainder. The problem resembles the NP-hard largest common subgraph problem, which
S. Bachl, D. Gmach
core
Tree Independence Number III. Thetas, Prisms and Stars
Journal of Graph Theory, EarlyView.ABSTRACT We prove that for every t ∈ N $t\in {\mathbb{N}}$ there exists τ = τ ( t ) ∈ N $\tau =\tau (t)\in {\mathbb{N}}$ such that every (theta, prism, K 1 , t ${K}_{1,t}$)‐free graph has tree independence number at most τ $\tau $ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky +2 more
wiley +1 more source
Social tectonics: Rapid organization of online COVID communities. [PDF]
PLoS OneVan Koevering K, Hong Y, Kleinberg J.
europepmc +1 more source
The Study of Perplexity due to Isomorphism of Component parts of 𠯑 and 舌
HANMUNHAKRONCHIP: Journal of Korean Literature in Chinese, 2015 openaire +1 more source
The four parity-check constraints R1-R4 are identified as the exact F2 binary generators of the Pati-Salam GUT (SU(4)_C x SU(2)_L x SU(2)_R). Parity checks activate sequentially as the universe cools past Landauer thresholds. The R2 constraint scale (~10^15 GeV) converges with the GUT scale.
openaire +3 more sources
On Odd Covers of Cliques and Disjoint Unions
Journal of Graph Theory, EarlyView.ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan +7 more
wiley +1 more source
Non-isomorphic abelian varieties with the same arithmetic. [PDF]
R Soc Open SciBell J.
europepmc +1 more source