Tootfinder

Starker Euro: Grafikkartenpreise sinken durch die Bank
Der starke Euro spiegelt sich bei Desktop-Grafikkarten wider. Nvidia selbst passt die Preise seiner Founders Editions an.
https://www.

On the representation number of grid graphs and cylindric grid graphs
Nawaf Shafi Alshammari, Sergey Kitaev, Artem Pyatkin
https://arxiv.org/abs/2507.16469

On the representation number of grid graphs and cylindric grid graphs
The representation number of a graph is the minimum number of copies of each vertex required to represent the graph as a word, such that the letters corresponding to vertices $x$ and $y$ alternate if and only if $xy$ is an edge in the graph. It is known that path graphs, circle graphs, and ladder graphs have representation number 2, while prism graphs have representation number 3. In this paper, we extend these results by showing that generalizations of the aforementioned graphs -- namely, th…

It's only Tuesday so stay ahead of the curve by checking out today's Metacurity for the most critical infosec developments you should know, including
--Three Chinese threat groups exploited SharePoint flaws, Microsoft,
--Businesses will have to report ransom payments in UK,
--AZ election officials blast CISA after Iran site defacement,
--Dutch public prosecutors disconnected after suspected hack,
--SoCal engineer pleads guilty to missile-related blueprint…

Three Chinese threat groups exploited SharePoint flaws, Microsoft
Businesses will have to report ransom payments in UK, AZ election officials blast CISA after Iran site defacement, Dutch public prosecutors disconnected after suspected hack, SoCal engineer pleads guilty to missile-related blueprints theft, Aussie body sues Fortnum for client data theft, much more

Media Matters sues the FTC, says its inquiry into advertiser boycotts of X is part of a "campaign of retribution" by the Trump administration and Elon Musk (New York Times)
https://www.nytimes.com/2025/06/23/technology/media-matters-ftc-lawsu…

Media Matters Sues F.T.C. Over Advertising Investigation
The liberal advocacy organization said in a lawsuit that the Federal Trade Commission’s inquiry into boycotts with other advertising groups was “retribution.”

CITE: A Comprehensive Benchmark for Heterogeneous Text-Attributed Graphs on Catalytic Materials
Chenghao Zhang, Qingqing Long, Ludi Wang, Wenjuan Cui, Jianjun Yu, Yi Du
https://arxiv.org/abs/2508.15392

CITE: A Comprehensive Benchmark for Heterogeneous Text-Attributed Graphs on Catalytic Materials
Text-attributed graphs(TAGs) are pervasive in real-world systems,where each node carries its own textual features. In many cases these graphs are inherently heterogeneous, containing multiple node types and diverse edge types. Despite the ubiquity of such heterogeneous TAGs, there remains a lack of large-scale benchmark datasets. This shortage has become a critical bottleneck, hindering the development and fair comparison of representation learning methods on heterogeneous text-attributed graph…

Ausstellungs-TiPP #Basel: Das #Cartoon Museum Basel zeigt die erste Retrospektive in Europa der amerikanischen Comic-Autorin Alison Bechdel und Graphic-Novel-Pionierin. Bis zum 26.10.2025. - Alison Bechdel. The Essential

Sources: Google is seeking to recruit news organizations for a new licensing project related to AI, and plans to launch a pilot initially with ~20 US outlets (Bloomberg)
https://www.bloomberg.com/news/articles/2025-07-22/go…

Planar induced paths via a decomposition into non-crossing ordered graphs
Julien Duron, Hugo Jacob
https://arxiv.org/abs/2509.17835 https://arxiv.org/pdf/2…

Planar induced paths via a decomposition into non-crossing ordered graphs
In any graph, the maximum size of an induced path is bounded by the maximum size of a path. However, in the general case, one cannot find a converse bound, even up to an arbitrary function, as evidenced by the case of cliques. Galvin, Rival and Sands proved in 1982 that, when restricted to weakly sparse graphs, such a converse property actually holds. In this paper, we consider the maximal function $f$ such that any planar graph (and in general, any graph of bounded genus) containing a path o…

Closed Walks Of Low Dimension And Twisted Moments On Self-Loop Graphs
Johnny Lim
https://arxiv.org/abs/2509.17035 https://arxiv.org/pdf/2509.17035

Closed Walks Of Low Dimension And Twisted Moments On Self-Loop Graphs
Let $G_S$ be a graph with loops attached at each vertex in $S \subseteq V(G).$ In this article, we develop exact formulae for the number of closed $3$- and $4$-walks on $G_S$ in terms of vertex degrees and certain elementary subgraphs of $G_S.$ We then derive the specific closed walks formulae for several graph families such as complete bipartite self-loop graphs, complete graphs, cycle graphs, etc. We demonstrate that such invariants are non-trivial in $G_S,$ which otherwise may be trivial in …

Colour-biased Hamilton cycles in dense graphs and random graphs
Natalie Behague, Debsoumya Chakraborti, Jared Le\'on
https://arxiv.org/abs/2509.18012 https://

Colour-biased Hamilton cycles in dense graphs and random graphs
A classical result of Dirac says that every $n$-vertex graph with minimum degree at least $\frac{n}{2}$ contains a Hamilton cycle. A `discrepancy' version of Dirac's theorem was shown by Balogh--Csaba--Jing--Pluhár, Freschi--Hyde--Lada--Treglown, and Gishboliner--Krivelevich--Michaeli as follows. Every $r$-colouring of the edge set of every $n$-vertex graph with minimum degree at least $(\frac{1}{2} + \frac{1}{2r} + o(1))n$ contains a Hamilton cycle where one of the colours appears at least $(…