Turán problems for k-geodetic digraphs

DOI10.1007/S00373-023-02619-XMaRDI QIDQ2689115zbMATH OpenOpenAlexFDO

Authors James Tuite, Grahame Erskine, Nika Salia

Publication date 9 March 2023

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2102.04957

zbMATH Keywords

\(k\)-geodeticdigraphextremalstrong-connectivityTurán problem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Quantile regression via the EM algorithm
• Influence Measures in Quantile Regression Models
• Quantile regression in linear mixed models: a stochastic approximation EM approach
• Bayesian quantile regression
• Quantile regression for longitudinal data using the asymmetric Laplace distribution

Cites work

• A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
• Cycles in digraphs– a survey
• Digraphs on permutations
• Explicit construction of graphs with an arbitrary large girth and of large size
• Extensions of Turán's theorem on graphs
• Extremal digraphs avoiding distinct walks of length 3 with the same endpoints
• Extremal digraphs avoiding distinct walks of length 4 with the same endpoints
• Girth in digraphs
• Graph theory with applications
• scientific article; zbMATH DE number 3505014 (Why is no real title available?)
• scientific article; zbMATH DE number 3258067 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3298603 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• Many \(T\) copies in \(H\)-free graphs
• Moore graphs and beyond: a survey of the degree/diameter problem
• On diregular digraphs with degree two and excess two
• On some applications of graphs to cryptography and turbocoding
• On the 0-1 matrices whose squares are 0-1 matrices
• On the maximum number of five-cycles in a triangle-free graph
• On the number of pentagons in triangle-free graphs
• Pentagons vs. triangles
• The maximum number of triangles in \(C_{2k+1}\)-free graphs

Cited in

(7)

• On the order and size of s-geodetic digraphs with given connectivity
• Quantile regression via the EM algorithm
• The Directed Geodetic Structure of a Strong Digraph
• On k-geodetic digraphs with excess one
• Turan problems for k-geodetic digraphs
• Extremal oriented graphs avoiding 1-subdivision of an in-star
• Extremal digraphs containing at most t paths of length 2 with the same endpoints

This page was built for publication: Turán problems for \(k\)-geodetic digraphs

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