Cover Image

Erdős-Gyárfás conjecture on graphs without long induced paths

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hegde, Anand Shripad, Sandeep, R. B., Shashank, P.
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
by: Majewski, Konrad, et al.
Published: (2022)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
by: Bourneuf, Romain, et al.
Published: (2025)

On the complexity of edge subdivision to $H$-free graphs
by: Piecyk, Marta, et al.
Published: (2026)

Switching Classes: Characterization and Computation
by: Antony, Dhanyamol, et al.
Published: (2024)

Optimal distance query reconstruction for graphs without long induced cycles
by: Bastide, Paul, et al.
Published: (2023)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
by: Chudnovsky, Maria, et al.
Published: (2024)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
by: Bonamy, Marthe, et al.
Published: (2022)

Finding a solution to the Erdős-Ginzburg-Ziv theorem in $O(n\log\log\log n)$ time
by: Leung, Yui Hin Arvin
Published: (2025)

On the Houdré-Tetali conjecture about an isoperimetric constant of graphs
by: Lau, Lap Chi, et al.
Published: (2024)

On Circular Threshold Words and Other Stronger Versions of Dejean's conjecture
by: Tunev, Igor N.
Published: (2025)

Improved exploration of temporal graphs
by: Bastide, Paul, et al.
Published: (2025)

Reconstructing edge-deleted unicyclic graphs
by: Pizzimenti, Anthony E., et al.
Published: (2024)

A note on Ordered Ruzsa-Szemerédi graphs
by: Pratt, Kevin
Published: (2025)

Faithful universal graphs for minor-closed classes
by: Bastide, Paul, et al.
Published: (2025)

Constructing disjoint Steiner trees in Sierpiński graphs
by: Yang, Chenxu, et al.
Published: (2023)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

Liar's vertex-edge domination in unit disk graph
by: Bhattacharya, Debojyoti, et al.
Published: (2025)

Faster diameter computation in graphs of bounded Euler genus
by: Kluk, Kacper, et al.
Published: (2025)

Liar's vertex-edge domination in subclasses of chordal graphs
by: Bhattacharya, Debojyoti, et al.
Published: (2025)

Isometric path complexity of graphs
by: Chakraborty, Dibyayan, et al.
Published: (2022)

Lower bounds for graph reconstruction with maximal independent set queries
by: Michel, Lukas, et al.
Published: (2024)

Sampling and counting triangle-free graphs near the critical density
by: Jenssen, Matthew, et al.
Published: (2024)

Testing H-freeness on sparse graphs, the case of bounded expansion
by: Humeau, Samuel, et al.
Published: (2025)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
by: Chalopin, Jérémie, et al.
Published: (2025)

Kernelization for list $H$-coloring for graphs with small vertex cover
by: Piecyk, Marta, et al.
Published: (2025)

On 2-strong connectivity orientations of mixed graphs and related problems
by: Georgiadis, Loukas, et al.
Published: (2023)

Compression with wildcards: All induced metric subgraphs
by: Wild, Marcel
Published: (2024)

Making an oriented graph acyclic using inversions of bounded or prescribed size
by: Bang-Jensen, Jørgen, et al.
Published: (2025)

Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs
by: Fang, Qiming, et al.
Published: (2026)

On graphs coverable by k shortest paths
by: Dumas, Maël, et al.
Published: (2022)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
by: Jenssen, Matthew, et al.
Published: (2024)

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
by: Biedl, Therese
Published: (2025)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
by: Daga, Mohit
Published: (2025)

The connectivity carcass of a vertex subset in a graph: both odd and even case
by: Baswana, Surender, et al.
Published: (2025)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
by: Galby, Esther, et al.
Published: (2025)

Burning rooted graph products
by: Peca-Medlin, John
Published: (2026)

Data reduction for directed feedback vertex set on graphs without long induced cycles
by: Dirks, Jona, et al.
Published: (2023)

Graph parameters that are coarsely equivalent to path-length
by: Dragan, Feodor F., et al.
Published: (2025)

Parameterized complexity of isometric path partition: treewidth and diameter
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
by: Hathcock, Daniel, et al.
Published: (2025)