Claude Tardif

1.1k total citations
60 papers, 517 citations indexed

About

Claude Tardif is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Claude Tardif has authored 60 papers receiving a total of 517 indexed citations (citations by other indexed papers that have themselves been cited), including 56 papers in Computational Theory and Mathematics, 34 papers in Discrete Mathematics and Combinatorics and 26 papers in Geometry and Topology. Recurrent topics in Claude Tardif's work include Advanced Graph Theory Research (41 papers), Limits and Structures in Graph Theory (28 papers) and Topological and Geometric Data Analysis (15 papers). Claude Tardif is often cited by papers focused on Advanced Graph Theory Research (41 papers), Limits and Structures in Graph Theory (28 papers) and Topological and Geometric Data Analysis (15 papers). Claude Tardif collaborates with scholars based in Canada, Czechia and Hungary. Claude Tardif's co-authors include Jaroslav Nešetřil, Benoît Larose, Anthony Bonato, Xuding Zhu, François Laviolette, David L. Wehlau, Gábor Simonyi, Aleš Pultr, Geňa Hahn and Reza Naserasr and has published in prestigious journals such as Advances in Mathematics, Theoretical Computer Science and Discrete Mathematics.

In The Last Decade

Claude Tardif

54 papers receiving 480 citations

Peers

Claude Tardif

CTM

DMC

GT

CNC

MP

Imre Leader United Kingdom

Mark Walters United Kingdom

Michael Krivelevich Israel

B. Bollobás United Kingdom

Walter Wenzel Germany

Hanno Lefmann Germany

Oriol Serra Spain

Gábor Simonyi Hungary

Gregory A. Freiman Israel

James H. Schmerl United States

Imre Leader United Kingdom

Claude Tardif

398 ×0.9

CTM

385 ×2.2

DMC

309 ×2.0

GT

61 ×0.6

CNC

137 ×1.6

MP

Citations per year, relative to Claude Tardif Claude Tardif (= 1×) peers Imre Leader

Countries citing papers authored by Claude Tardif

Since Specialization

Citations

This map shows the geographic impact of Claude Tardif's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Claude Tardif with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Claude Tardif more than expected).

Fields of papers citing papers by Claude Tardif

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Claude Tardif. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Claude Tardif. The network helps show where Claude Tardif may publish in the future.

Co-authorship network of co-authors of Claude Tardif

This figure shows the co-authorship network connecting the top 25 collaborators of Claude Tardif. A scholar is included among the top collaborators of Claude Tardif based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Claude Tardif. Claude Tardif is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Tardif, Claude. (2023). Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices. Commentationes Mathematicae Universitatis Carolinae. 63(3). 315–327.

2.

Tardif, Claude. (2023). Chromatic Ramsey numbers of generalised Mycielski graphs. Discussiones Mathematicae Graph Theory. 44(4). 1327–1327.

3.

Tardif, Claude. (2022). Counterexamples to Hedetniemi’s Conjecture with Large Fractional Chromatic Numbers. Graphs and Combinatorics. 38(6).

4.

Tardif, Claude & Gábor Tardos. (2016). CATERPILLAR DUALITIES AND REGULAR LANGUAGES. 1 indexed citations

5.

Tardif, Claude, et al.. (2016). Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers. Journal of Combinatorial Theory Series B. 122. 776–793. 2 indexed citations

6.

Naserasr, Reza, et al.. (2015). Homomorphisms of binary Cayley graphs. Discrete Mathematics. 338(12). 2539–2544. 2 indexed citations

7.

Tardif, Claude, et al.. (2014). Digraph functors which admit both left and right adjoints. Discrete Mathematics. 338(4). 527–535. 3 indexed citations

8.

Simonyi, Gábor, et al.. (2013). Colourful theorems and indices of homomorphism complexes. The Electronic Journal of Combinatorics. 20(1). 10. 5 indexed citations

9.

Nešetřil, Jaroslav, et al.. (2008). Generalised dualities and maximal finite antichains in the homomorphism order of relational structures. European Journal of Combinatorics. 29(4). 881–899. 20 indexed citations

10.

Tardif, Claude, et al.. (2008). Majority functions on structures with finite duality. European Journal of Combinatorics. 29(4). 979–986. 5 indexed citations

11.

Larose, Benoît, et al.. (2007). A Characterisation of First-Order Constraint Satisfaction Problems. Logical Methods in Computer Science. Volume 3, Issue 4. 30 indexed citations

12.

Tardif, Claude. (2005). Multiplicative graphs and semi-lattice endomorphisms in the category of graphs. Journal of Combinatorial Theory Series B. 95(2). 338–345. 15 indexed citations

13.

Nešetřil, Jaroslav & Claude Tardif. (2005). Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality. SIAM Journal on Discrete Mathematics. 19(4). 914–920. 26 indexed citations

14.

Nešetřil, Jaroslav, Aleš Pultr, & Claude Tardif. (2004). Gaps And Dualities In Heyting Categories. Commentationes Mathematicae Universitatis Carolinae. 48(1). 9–23. 3 indexed citations

15.

Côté, Alexandre, et al.. (2004). Orientations and $3$-colourings of graphs. Commentationes Mathematicae Universitatis Carolinae. 45(3). 549–553. 2 indexed citations

16.

Tardif, Claude & Xuding Zhu. (2002). The level of nonmultiplicativity of graphs. Discrete Mathematics. 244(1-3). 461–471. 4 indexed citations

17.

Tardif, Claude. (2001). The chromatic number of the product of two graphs is at least half the minimum of the fractional chromatic numbers of the factors.. Commentationes Mathematicae Universitatis Carolinae. 42(2). 353–355. 7 indexed citations

18.

Nešetřil, Jaroslav & Claude Tardif. (2000). Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations). Journal of Combinatorial Theory Series B. 80(1). 80–97. 78 indexed citations

19.

Tardif, Claude. (1998). Graph products and the chromatic difference sequence of vertex-transitive graphs. Discrete Mathematics. 185(1-3). 193–200. 11 indexed citations

20.

Tardif, Claude. (1997). A fixed box theorem for the cartesian product of graphs and metric spaces. Discrete Mathematics. 171(1-3). 237–248. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact