Saturation of edge-ordered graphs

DOI10.37236/13742MaRDI QIDQ7353672zbMATH OpenFDO

Authors Balázs Keszegh

Publication date 18 September 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13742

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Cites work

• A characterization of edge-ordered graphs with almost linear extremal functions
• A Problem in Graph Theory
• A survey of minimum saturated graphs
• Almost all permutation matrices have bounded saturation functions
• An exact characterization of saturation for permutation matrices
• scientific article; zbMATH DE number 3238444 (Why is no real title available?)
• Minimal oriented graphs of diameter 2
• On the decomposition of graphs into complete bipartite graphs
• On the number of tangencies among 1-intersecting \(x\)-monotone curves
• Pattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices
• Saturated graphs with minimal number of edges
• Saturation of Ordered Graphs
• Saturation problems about forbidden 0-1 submatrices
• Sequence saturation
• The Minimum Size of Saturated Hypergraphs
• The number of tangencies between two families of curves
• Turán problems for edge-ordered graphs

This page was built for publication: Saturation of edge-ordered graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7353672)