activity
20082026
most citedGraphs containing finite induced paths of unbounded length

3 citations · 5 across the 16 of their papers we have counts for

collaborators
Showing math.COShow all

18 papers · 1 filter

math.CO2025

Cops and Robbers, Clique Covers, and Induced Cycles

Alexander Clow, Imed Zaguia

We consider the Cops and Robbers game played on finite simple graphs. In a graph , the number of cops required to capture a robber in the Cops and Robbers game is denoted by $c(…

math.CO2024

The structure of interval orders with no infinite antichain

Maurice Pouzet, Imed Zaguia

We prove that if is a nonprime graph with either no infinite independent set or no infinite clique, then every vertex of belongs to a maximal strong module distinct f…

math.CO2023

The Aharoni--Korman conjecture for posets whose incomparability graph is locally finite

Imed Zaguia

Aharoni and Korman (Order 9 (1992) 245--253) have conjectured that every ordered set without infinite antichains possesses a chain and a partition into antichains so that each part…

math.CO2022

Minimal prime ages, words and permutation graphs

Djamila Oudrar, Maurice Pouzet, Imed Zaguia

This paper is a contribution to the study of hereditary classes of finite graphs. We classify these classes according to the number of prime structures they contain. We consider su…

math.CO2022

Minimal prime ages, words and permutation graphs Extended abstract

Djamila Oudrar, Maurice Pouzet, Imed Zaguia

This paper is a contribution to the study of hereditary classes of finite graphs. We classify these classes according to the number of prime structures they contain. We consider su…

math.CO2021

Hereditary classes of ordered sets of width at most two

Maurice Pouzet, Imed Zaguia

This paper is a contribution to the study of hereditary classes of relational structures, these classes being quasi-ordered by embeddability. It deals with the specific case of ord…

math.CO2021

Metric properties of incomparability graphs with an emphasis on paths

Maurice Pouzet, Imed Zaguia

We describe some metric properties of incomparability graphs. We consider the problem of the existence of infinite paths, either induced or isometric, in the incomparability graph…

math.CO2021

Permutations Avoiding Certain Partially-ordered Patterns

Kai Ting Keshia Yap, David Wehlau, Imed Zaguia

A permutation contains a pattern if and only if there is a subsequence in with its letters are in the same relative order as those in . Partially ordered patterns (P…

math.CO2020★ 3 cited

Graphs containing finite induced paths of unbounded length

Maurice Pouzet, Imed Zaguia

The age of a graph (undirected and without loops) is the collection of finite induced subgraphs of , considered up to isomorphy and ordered by embeddability…

math.CO2020

Greedy balanced pairs in -free ordered sets

Imed Zaguia

An -greedy balanced pair in an ordered set is a pair of elements of such that the proportion of greedy linear extensions of that put before …

math.CO2018

The Aharoni--Korman conjecture for -free posets with no infinite antichain

Imed Zaguia

We give a necessary and sufficient condition for a -free graph to be a cograph. This allows us to obtain a simple proof of the fact that finite -free graphs are finite co…

math.CO2017

Interval orders, semiorders and ordered groups

Maurice Pouzet, Imed Zaguia

We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection of…

math.CO2016★ 1 cited

Iterated Arc Graphs

Danny Rorabaugh, Claude Tardif, David Wehlau +1

The arc graph of a digraph is the digraph with the set of arcs of as vertex-set, where the arcs of join consecutive arcs of . In 1981, Poljak and Rödl char…

math.CO2016

The 1/3-2/3 Conjecture for ordered sets whose cover graph is a forest

Imed Zaguia

A balanced pair in an ordered set is a pair of elements of such that the proportion of linear extensions of that put before is in the real inte…

math.CO2014★ 1 cited

Pairs of orthogonal countable ordinals

Claude Laflamme, Maurice Pouzet, Nobert Sauer +1

We characterize pairs of orthogonal countable ordinals. Two ordinals and are orthogonal if there are two linear orders and on the same set with order types …

math.CO2011

Some inequalities for orderings of acyclic digraphs

Thomas Bier, Imed Zaguia

Let be an acyclic digraph. For define to be the difference of the indegree and the outdegree of . An acyclic ordering of the vertices of is…

math.CO2011

The 1/3-2/3 conjecture for -free ordered sets

Imed Zaguia

A balanced pair in a finite ordered set is a pair of elements of such that the proportion of linear extensions of that put before is in the rea…

math.CO2008

On minimal prime graphs and posets

Maurice Pouzet, Imed Zaguia

We show that there are four infinite prime graphs such that every infinite prime graph with no infinite clique embeds one of these graphs. We derive a similar result for infinite p…