A random graph with (1+e)n/2-edges contains a path of length cn. A random directed graph with (1+e)n edges contains a directed path of length cn. This settles a conjecture of Erdôs.Peer reviewe
Abstract. We consider a directed graph on the 2-dimensional integer lattice, plac-ing a directed edg...
A probability measure on the subsets of the edge set of a graph G is a 1‐independent probability me...
We present a modification of the Depth first search algorithm, suited for finding long induced paths...
We consider random graphs with n labelled vertices in which edges are chosen independently and with ...
Given a graph, its 2-core is the maximal subgraph of G without vertices of degree 1. A 2-path in a c...
Consider a random regular graph with degree d and of size n. Assign to each edge an independent and ...
International audienceWe consider an inhomogeneous version of the Barak-Erd\H{o}s graph, i.e. a dire...
ABSTRACT: For a given finite graph G of minimum degree at least k, let Gp be a random subgraph of G ...
We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries...
Given a graph G and a bijection f : E(G) → {1, 2,…,e(G)}, we say that a trail/path in G is f-increas...
ABSTRACT. We study distance properties of a general class of random directed acyclic graphs (DAGs). ...
21 pages, 2 figuresInternational audienceWe study distance properties of a general class of random d...
21 pages, 2 figuresInternational audienceWe study distance properties of a general class of random d...
We investigate the computational hardness of approximating the longest path and the longest cycle in...
The Price model, the directed version of the Barabasi-Albert model, produces a growing directed acyc...
Abstract. We consider a directed graph on the 2-dimensional integer lattice, plac-ing a directed edg...
A probability measure on the subsets of the edge set of a graph G is a 1‐independent probability me...
We present a modification of the Depth first search algorithm, suited for finding long induced paths...
We consider random graphs with n labelled vertices in which edges are chosen independently and with ...
Given a graph, its 2-core is the maximal subgraph of G without vertices of degree 1. A 2-path in a c...
Consider a random regular graph with degree d and of size n. Assign to each edge an independent and ...
International audienceWe consider an inhomogeneous version of the Barak-Erd\H{o}s graph, i.e. a dire...
ABSTRACT: For a given finite graph G of minimum degree at least k, let Gp be a random subgraph of G ...
We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries...
Given a graph G and a bijection f : E(G) → {1, 2,…,e(G)}, we say that a trail/path in G is f-increas...
ABSTRACT. We study distance properties of a general class of random directed acyclic graphs (DAGs). ...
21 pages, 2 figuresInternational audienceWe study distance properties of a general class of random d...
21 pages, 2 figuresInternational audienceWe study distance properties of a general class of random d...
We investigate the computational hardness of approximating the longest path and the longest cycle in...
The Price model, the directed version of the Barabasi-Albert model, produces a growing directed acyc...
Abstract. We consider a directed graph on the 2-dimensional integer lattice, plac-ing a directed edg...
A probability measure on the subsets of the edge set of a graph G is a 1‐independent probability me...
We present a modification of the Depth first search algorithm, suited for finding long induced paths...
DOI
Add to ORKG