English
Related papers

Related papers: Graph-null sets

200 papers

We prove that almost every level set of a Sobolev function in a planar domain consists of points, Jordan curves, or homeomorphic copies of an interval. For monotone Sobolev functions in the plane we have the stronger conclusion that almost…

Classical Analysis and ODEs · Mathematics 2020-10-30 Dimitrios Ntalampekos

A graph $G$ is said to be $\mathcal H(n,\Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. It is known that for any $\varepsilon > 0$ and any natural number $\Delta$ there exists $c > 0$ such…

Combinatorics · Mathematics 2016-02-02 David Conlon , Asaf Ferber , Rajko Nenadov , Nemanja Škorić

A graph class $\mathcal{G}$ admits product structure if there exists a constant $k$ such that every $G \in \mathcal{G}$ is a subgraph of $H \boxtimes P$ for a path $P$ and some graph $H$ of treewidth $k$. Famously, the class of planar…

Combinatorics · Mathematics 2024-09-04 Laura Merker , Lena Scherzer , Samuel Schneider , Torsten Ueckerdt

Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is of type 1 if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…

Classical Analysis and ODEs · Mathematics 2018-01-31 Zoltán Buczolich , Balázs Maga , Gáspár Vértesy

A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs…

Commutative Algebra · Mathematics 2012-07-11 Rashid Zaare-Nahandi

A graph is determined by its signless Laplacian spectrum if there is no other non-isomorphic graph sharing the same signless Laplacian spectrum. Let $C_l$, $P_l$, $K_l$ and $K_{s,l-s}$ be the cycle, the path, the complete graph and the…

Combinatorics · Mathematics 2025-04-28 Jiachang Ye , Jianguo Qian , Zoran Stanić

This paper introduces a novel topology, referred to as the star topology, on finite graphs. By treating vertices and edges as points in a unified space, we explore continuous maps between Bare representations of a graph and their…

Combinatorics · Mathematics 2025-07-21 Rodolfo E. Maza

We prove various results connecting structural or algebraic properties of graphs and groups to conditions on their spaces of harmonic functions. In particular: we show that a group with a finitely supported symmetric measure has a…

Group Theory · Mathematics 2016-09-22 Matthew Tointon

We show that the graph of a bent function is a Salem set in an appropriate sense. We also establish a simple result that quantifies redundancies in the difference operators of a function, which applies to bent functions over fields of odd…

Combinatorics · Mathematics 2025-11-25 Robert S. Coulter , Steven Senger

We give an example of a convex, finite and lower semicontinuous function whose subdifferential is everywhere empty. This is possible since the function is defined on an incomplete normed space. The function serves as a universal…

Optimization and Control · Mathematics 2024-09-30 Gerd Wachsmuth

We propose a representation of graph as a functional object derived from the power iteration of the underlying adjacency matrix. The proposed functional representation is a graph invariant, i.e., the functional remains unchanged under any…

Machine Learning · Computer Science 2014-04-22 Anshumali Shrivastava , Ping Li

This paper is a continuation of work started in \cite{njampavcont} on preserving continuity in ideal topological spaces. We will deal with $\theta$-continuity and weak continuity and give their translations in ideal topological spaces. As…

General Topology · Mathematics 2022-12-06 Anika Njamcul , Aleksandar Pavlović

We study the Fourier dimensions of graphs of real-valued functions defined on the unit interval [0,1]. Our results imply that the graph of the fractional Brownian motion is almost surely not a Salem set, answering in part a question of…

Classical Analysis and ODEs · Mathematics 2014-10-06 Jonathan M. Fraser , Tuomas Orponen , Tuomas Sahlsten

For a group $\Gamma$, a $\Gamma$-labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $\Gamma$ so that opposite orientations of the same edge are assigned inverse elements. A path in $G$ is…

The second author's $\omega$, $\Delta$, $\chi$ conjecture proposes that every graph satisties $\chi \leq \lceil \frac 12 (\Delta+1+\omega)\rceil$. In this paper we prove that the conjecture holds for all claw-free graphs. Our approach uses…

Discrete Mathematics · Computer Science 2012-12-14 Andrew D. King , Bruce A. Reed

In the following text for Khalimsky $n-$dimensional space $\mathcal{K}^n$ we show self--map $f:\mathcal{K}^n\to\mathcal{K}^n$ has closed graph if and only if there exist integers $\lambda_1,\ldots,\lambda_n$ such that $f$ is a constant map…

General Topology · Mathematics 2025-01-07 Mehrnaz Pourattar , Fatemah Ayatollah Zadeh Shirazi , Mohammad Reza Mardanbeigi

One of the classical results concerning differentiability of continuous functions states that the set $\mathcal{SD}$ of somewhere differentiable functions (i.e., functions which are differentiable at some point) is Haar-null in the space…

Functional Analysis · Mathematics 2020-07-28 Adam Kwela , Wojciech Aleksander Wołoszyn

In $\mathbb R^n$, we parametrize Kakeya sets using Kakeya maps. A Kakeya map is defined to be a map $$\phi:B^{n-1}(0,1)\times [0,1]\rightarrow \mathbb{R}^{n}, (v,t)\mapsto (c(v)+tv,t),$$ where $ c:B^{n-1}(0,1)\rightarrow \mathbb{R}^{n-1}$.…

Classical Analysis and ODEs · Mathematics 2023-06-21 Yuqiu Fu , Shengwen Gan

The $d$-plane transform maps functions to their integrals over $d$-planes in $\mathbb{R}^n$. We study the following question: if a function vanishes in a bounded open set, and its $d$-plane transform vanishes on all $d$-planes intersecting…

Classical Analysis and ODEs · Mathematics 2025-02-12 Divyansh Agrawal , Nisha Singhal

We prove that the \emph{standard zero forcing number} $Z(G)$ and the \emph{positive semidefinite zero forcing number} $Z_+(G)$ are equal for all claw-free graphs $G$. This result resolves a conjecture proposed by the computer program…

Combinatorics · Mathematics 2024-12-19 Randy Davila , Houston Schuerger , Ben Small