Related papers: A Summary of Problems and Results related to the C…
The Caccetta-Haggkvist conjecture states that if G is a finite directed graph with at least n/k edges going out of each vertex, then G contains a directed cycle of length at most k. Hamidoune used methods and results from additive number…
These are my notes for a talk at the The Tate Conjecture workshop at the American Institute of Mathematics in Palo Alto, CA, July 23--July 27, 2007, somewhat revised and expanded. The intent of the talk was to review what is known and to…
We show that we cannot avoid the existence of at least one directed circuit of length less than or equal to (n/r) in a digraph on n vertices with out-degree greater than or equal to r. This is well-known Caccetta-Haggkvist problem.
We propose a new conjecture on hardness of low-degree $2$-CSP's, and show that new hardness of approximation results for Densest $k$-Subgraph and several other problems, including a graph partitioning problem, and a variation of the Graph…
These are lecture notes from my talks at the "Current Developments in Mathematics" conference (Harvard, 2006). They cover a variety of topics involving symplectic cohomology. In particular, a discussion of (algorithmic) classification…
This thesis deals with applications of experimental mathematics to a number of problems. The first problem is related to random graph statistics. We consider a certain class of Galton-Watson random trees and look at the total height…
For a digraph $G$ and $v \in V(G)$, let $\delta^+(v)$ be the number of out-neighbors of $v$ in $G$. The Caccetta-H\"{a}ggkvist conjecture states that for all $k \ge 1$, if $G$ is a digraph with $n = |V(G)|$ such that $\delta^+(v) \ge n/k$…
We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…
In this article we give a survey on open problems and conjectures concerning L^2-invariants. We cover the whole portfolio and not only certain aspects as they are considered in the previous more specialized (and within their scope more…
The purpose of this article is to survey the developments on the Kakeya problem in recent years, concentrating on the period after the excellent 1999 survey of Wolff, and including some recent work by the authors. We will focus on the…
Let $G$ be a regular graph of degree $d$ and let $A\subset V(G)$. Say that $A$ is $\eta$-closed if the average degree of the subgraph induced by $A$ is at least $\eta d$. This says that if we choose a random vertex $x\in A$ and a random…
Caccetta-H\"{a}ggkvist conjecture is a longstanding open problem on degree conditions that force an oriented graph to contain a directed cycle of a bounded length. Motivated by this conjecture, Kelly, K\"uhn, and Osthus initiated a study of…
In the theory of digraphs, the study of cycles is a subject of great importance and has given birth to a number of deep questions such as the Behzad-Chartrand-Wall conjecture (1970) and its generalization, the Caccetta-H\"{a}ggkvist…
This paper is around the topics I discussed in the lecture I gave at the Isaac Newton Institute in Cambridge, July 2009, in the Introductory Workshop. This paper can be read as a companion to my paper [Sa\"i di], where detailed proofs can…
This survey reports on current progress of programs to classify graph C*-algebras and Leavitt path algebras up to Morita equivalence using K-theory. Beginning with an overview and some history, we trace the development of the classification…
Algebraic statistics is concerned with the study of probabilistic models and techniques for statistical inference using methods from algebra and geometry. This article presents a list of open mathematical problems in this emerging field,…
The Caccetta-Haggkvist conjecture made in 1978 asserts that every orgraph on n vertices without oriented cycles of length <= l must contain a vertex of outdegree at most (n-1)/l. It has a rather elaborate set of (conjectured) extremal…
This note summarizes the talk by the author at the workshop "Geometry and Computer Science" held in Pescara in February 2017. We present how SageMath can help in research in Complex and Differential Geometry, with two simple applications,…
Since the transformative workshop by the American Institute of Mathematics on the minimum rank of a graph, two longstanding open problems have captivated the community interested in the minimum rank of graphs: the graph complement…
Some conjectures and open problems in convex geometry are presented, and their physical origin, meaning, and importance, for quantum theory and generic statistical theories, are briefly discussed.