Apr 17, 2020 · In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph G G with each edge ...
Feb 26, 2020 · Abstract:In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph G, \{-1, ...
Jan 4, 2019 · Here we investigate the discrepancy of (spanning) trees, paths and Hamilton cycles. That is for a graph G let SG be the set of spanning trees ( ...
Oct 22, 2024 · In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph G G with each edge ...
Dec 10, 2024 · In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph G, ...
constant. A subset of vertices with large discrepancy can clearly be either more or less dense than the whole graph. Let us define the positive discrep ...
This project intends to study some problems in the discrepancy of graphs. Roughly speaking, discrepancy is a measure of how “complicated” a set system is.
We further show that GNNs designed for globally heterophilous graphs can alleviate performance discrepancy by improving performance across local homophily ...
Discrepancy of hypergraphs is an area of discrepancy theory that studies the discrepancy of general set systems. Contents. 1 Definitions; 2 Examples ...
Let G be a graph with n vertices and p( n2 ) edges, and define the discrepancies disc + p (G) = max Y⊂V(G) {e(Y) − p( |Y|2 )} and disc − p (G) = max Y⊂V(G) ...