Results 61 to 70 of about 351 (173)
Simonovits's theorem in random graphs
Abstract Let H$H$ be a graph with χ(H)=r+1$\chi (H) = r+1$. Simonovits's theorem states that, if H$H$ is edge‐critical, the unique largest H$H$‐free subgraph of Kn$K_n$ is its largest r$r$‐partite subgraph, provided that n$n$ is sufficiently large. We show that the same holds with Kn$K_n$ replaced by the binomial random graph Gn,p$G_{n,p}$ whenever H$H$
Ilay Hoshen, Wojciech Samotij
wiley +1 more source
Color-critical graphs and hypergraphs with few edges and no short cycles
An \(r\)-coloring of a hypergraph \((V, {\mathcal G})\) with vertex set \(V\) and edge set \({\mathcal G}\) is a coloring of its vertices with at most \(r\) colors such that each edge is incident with at least two vertices of different colors. \((V, {\mathcal G})\) is \(r\)-chromatic if \(r\) is the smallest integer for which \((V, {\mathcal G})\) is \(
H. L. Abbott +2 more
openaire +1 more source
The HGN‐MSP model addresses academic performance prediction challenges through multimodal graph learning with semantic alignment and modality balancing, achieving 0.896 AUC and 5.3% improvement over XGBoost in precisely identifying at‐risk students on a dataset of 19,856 students.
Jun Fan, Bin Chen, Byungwon Min, Tao Xie
wiley +1 more source
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
Topological, Compositional, and Dynamic Information in Chemical Reaction Systems
Chemical reaction systems transform and organize information encoded in molecular structure, composition and environmental inputs. Reaction topology constrains how information propagates through a network, shaping both compositional outcomes and dynamic responses.
William E. Robinson
wiley +1 more source
New hardness results for graph and hypergraph colorings.
Finding a proper coloring of a t-colorable graph G with t colors is a classic NP-hard problem when t >= 3. In this work, we investigate the approximate coloring problem in which the objective is to find a proper c-coloring of G where c >= t. We show that for all t >= 3, it is NP-hard to find a c-coloring when c
Brakensiek, Joshua +1 more
openaire +4 more sources
Metric spaces with small rough angles and the rectifiability of rough self‐contracted curves
Abstract The small rough angle (SRA$\operatorname{SRA}$) condition, introduced by Zolotov in arXiv:1804.00234, captures the idea that all angles formed by triples of points in a metric space are small. In the first part of the paper, we develop the theory of metric spaces (X,d)$(X,d)$ satisfying the SRA(α)$\operatorname{SRA}(\alpha)$ condition for some
Estibalitz Durand Cartagena +1 more
wiley +1 more source
Topology‐Aware Deep Learning on Higher‐Order Structures for Drug Response Prediction
We present TopDr, a topology‐aware deep learning framework that encodes both drugs and cell lines as multiscale simplicial complexes, capturing interactions at the 0‐, 1‐, and 2‐simplex levels. By jointly integrating local higher‐order neighborhoods and global topological structures, TopDr generates enriched representations for sensitivity prediction ...
Cong Shen +3 more
wiley +1 more source
Partitioning 3-colored complete graphs into three monochromatic cycles [PDF]
We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core +1 more source
Strong Colorings of Hypergraphs
A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph coloring problems.
Magnús M. Halldórsson, Geir Agnarsson
core +1 more source

