Tootfinder

Excluding an induced wheel minor in graphs without large induced stars
Mujin Choi, Claire Hilaire, Martin Milani\v{c}, Sebastian Wiederrecht
https://arxiv.org/abs/2506.08829

Excluding an induced wheel minor in graphs without large induced stars
We study a conjecture due to Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht stating that for any positive integer $d$ and any planar graph $H$, the class of all $K_{1,d}$-free graphs without $H$ as an induced minor has bounded tree-independence number. A $k$-wheel is the graph obtained from a cycle of length $k$ by adding a vertex adjacent to all vertices of the cycle. We show that the conjecture of Dallard et al. is true when $H$ is a $k$-wheel for any $k\geq 3$. Our proof us…

The McIver Indictment Explained
https://joycevance.substack.com/p/the-mciver-indictment-explained

Nvidia will sich in der europäischen KI-Welt verankern
In Europa entstehen sechs Forschungszentren mit Nvidia. Zudem will die Firma eine "Industrial AI Cloud" für hiesige Firmen bauen.
https://w…

Rep. LaMonica McIver indicted on federal charges over clash with law enforcement at ICE facility in New Jersey (Raquel Coronell Uribe/NBC News)
https://www.nbcnews.com/politics/congress/lamonica-mciver-indicted-federal-charges-ice-new-jersey-rcna212221
http://www.memeorandum.com/250610/p147#a250610p147

Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
Junfeng Liu, Jiarui Ye, Mengshi Chen, Meng Li, Siqiang Luo
https://arxiv.org/abs/2506.08671 …

Evaluating Learned Indexes in LSM-tree Systems: Benchmarks,Insights and Design Choices
LSM-tree-based data stores are widely used in industry due to their exceptional performance. However, as data volumes grow, efficiently querying large-scale databases becomes increasingly challenging. To address this, recent studies attempted to integrate learned indexes into LSM-trees to enhance lookup performance, which has demonstrated promising improvements. Despite this, only a limited range of learned index types has been considered, and the strengths and weaknesses of different learned i…

Where Journalism Silenced Voices: Exploring Discrimination in the Representation of Indigenous Communities in Bangladesh
Abhijit Paul, Adity Khisa, Zarif Masud, Sharif Md. Abdullah, Ahmedul Kabir, Shebuti Rayana
https://arxiv.org/abs/2506.09771

Where Journalism Silenced Voices: Exploring Discrimination in the Representation of Indigenous Communities in Bangladesh
In this paper, we examine the intersections of indigeneity and media representation in shaping perceptions of indigenous communities in Bangladesh. Using a mixed-methods approach, we combine quantitative analysis of media data with qualitative insights from focus group discussions (FGD). First, we identify a total of 4,893 indigenous-related articles from our initial dataset of 2.2 million newspaper articles, using a combination of keyword-based filtering and LLM, achieving 77% accuracy and an …

Apple says ChatGPT image generation is now available in Image Playground with new ChatGPT styles, releases an API, adds Genmoji text descriptions, and more (Hartley Charlton/MacRumors)
https://www.macrumors.com/2025/06/09/chatgpt-integration-co…

ChatGPT Integration Coming to Apple's Image Playground
Apple today revealed a number of updates for Image Playground and Genmoji. ChatGPT image generation is now available directly in Image Playground,...

Infinite induced-saturated graphs
Marthe Bonamy, Carla Groenland, Tom Johnston, Natasha Morrison, Alex Scott
https://arxiv.org/abs/2506.08810 https://

Infinite induced-saturated graphs
A graph $G$ is $H$-induced-saturated if $G$ is $H$-free but deleting any edge or adding any edge creates an induced copy of $H$. There are various graphs $H$, such as $P_4$, for which no finite $H$-induced-saturated graph $G$ exists. We show that for every finite graph $H$ that is not a clique or stable set, there always exists a countable $H$-induced-saturated graph. In fact, a stronger property can be achieved: there is an $H$-free graph $G$ such that $G'$ contains a copy of $H$ whenever $G'\…

Acting NJ U.S. Attorney Alina Habba says Rep. LaMonica McIver indicted (Katie Sobko/NorthJersey.com)
https://eu.northjersey.com/story/news/new-jersey/2025/06/10/nj-us-attorney-alina-habba-rep-lamonica-mciver-indicted/84141017007/
http://www.memeorandum.com/250611/p5#a250611p5

Degree Sequence of Albertson and $\sigma$-Indices on Trees of Order $n\geqslant 3$
Jasem Hamoud, Artem Kornosov
https://arxiv.org/abs/2506.08213 https://…

Degree Sequence of Albertson and $σ$-Indices on Trees of Order $n\geqslant 3$
In this paper, we presented a study of topological indices on trees, where we show a relationship with irregularity of Albertson index and minimum, maximum degrees $δ,Δ$ of graph $G$, where contribute vital roles in determining connection, shading, component incorporation, and realisability where well-known Albertson index as: $\operatorname{irr}(G)=\sum_{uv\in E(G)}\lvert d_u(G)-d_v(G) \rvert$. The sigma index on trees that we introduced as $σ(T)=(d_1-1)^3+\sum_{i=1}^{3}(d_i-1)(d_i-2)+(d_3-…